Explore BrainMass
Share

Explore BrainMass

    Proof of infinite primes

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    Prove: There are infinitely many prime numbers p of the form 4n+3. In other words, show that there exist infinitely many positive integers, n, such that the number 4n+1 is prime.

    © BrainMass Inc. brainmass.com October 9, 2019, 3:23 pm ad1c9bdddf
    https://brainmass.com/math/number-theory/proof-infinite-positive-integers-3023

    Solution Preview

    Note: the notation "p_k" means p with a subscript k.

    The proof of this problem can be seen as a kind of generalization of Euclid's proof that there are infinitely many primes. You have most likely seen Euclid's proof if you are in a basic undergraduate number theory course.

    The solution of this problem, like Euclid's, is a proof by contradiction:

    Assume there are only finitely many primes of the form 4n+3.
    Let ...

    Solution Summary

    This is a proof regarding infinite numbers of primes.

    $2.19