Adapt the proof in the text that there are infinitely many primes to prove that there are infinitely many primes of the form 3 k +2 , where k is a nonnegative integer. [Hint: Suppose that there are only finitely many such primes q 1 , q 2 , ... , q n , and consider the number 3 q 1 q 2 ... q n -1 .]
Adapt the proof in the text that there are infinitely many primes to prove that there are infinitely many primes of the form 3 k +2 , where k is a nonnegative integer. [Hint: Suppose that there are only finitely many such primes q 1 , q 2 , ... , q n , and consider the number 3 q 1 q 2 ... q n -1 .]
Solution Summary: The author proves that there are infinitely many primes of the form 3k + 2, where k is a nonnegative integer.
Adapt the proof in the text that there are infinitely many primes to prove that there are infinitely many primes of the form
3
k
+2
, where k is a nonnegative integer.
[Hint: Suppose that there are only finitely many such primes
q
1
,
q
2
,
...
,
q
n
, and consider the number
3
q
1
q
2
...
q
n
-1
.]
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
MFCS unit-1 || Part:1 || JNTU || Well formed formula || propositional calculus || truth tables; Author: Learn with Smily;https://www.youtube.com/watch?v=XV15Q4mCcHc;License: Standard YouTube License, CC-BY