Ask your own question, for FREE!
Mathematics 10 Online
OpenStudy (goformit100):

Show that there are infinitely many primes of the form 4n+3.

OpenStudy (goformit100):

@qweqwe123123123123111 @dan815 @Zarkon

OpenStudy (anonymous):

Is this where you have 1+2+3+. . . +4n+3?

OpenStudy (anonymous):

well, assume there are only finite then show that if you combine all (4n+3) primes together, and probably add/subtract 1, you create a new prime not in your list thus, there must be infinite primes

OpenStudy (anonymous):

But in this case it would 1,3,5,7,11,13,17 and so on.

OpenStudy (goformit100):

ok

OpenStudy (anonymous):

like, for instance, assume 4n+3 only holds true for values n <= 10 however, if you combine the numbers 4n+3 together, you notice you will (eventually) create another prime larger than n<=100, meaning there must be more primes beyond n <=100

OpenStudy (anonymous):

woops, the two last 100's should be 10s

OpenStudy (goformit100):

Thankyou

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!