Question

In: Computer Science

Prove this is true: The sequence {4k + 3} where k ∈ N contains infinitely many...

Prove this is true: The sequence {4k + 3} where k ∈ N contains infinitely many primes, but the sequence {4k + 2} does not. Show your work.

Solutions

Expert Solution

  • Below is the detailed explanation of the above mentioned problem.
  • To prove : the sequence (4k+3) contains infinitely many primes, but the sequence (4k+2) does not where k belongs to set of Natural numbers.
  • Prime number: A number which only has 2 factors i.e, 1 and the number itself.
  • Explanation:

Let's write (4k+3) for some k, 7(k=1), 11(k=2), 15(k=3), 19(k=4), 23(k=5).................., So we can see that this sequence is an arithmetic progression(A.P) with first term as 7 and common difference as 4, and there will be many prime numbers in the sequence as we can see that for k=1,2,4,5,7,10,11,14,16,17,19,20 and so on we get a prime number in the sequence.

  • Proof for (4k+3):

So to prove this above fact we use Euclid's proof of infinitude of primes, suppose there are finite primes in the sequence (4k+3) like 7(=t1), 11(=t2), 19(=t3).............(=tm),

Now let's consider a number x=(4*t1*t2*t3*t4.......tm) -1, so this x can be rewritten as x=4((t1*t2*t3*t4.......tm)-1)+3 which is of the form (4n+3), now as we have considered the primes in the sequence as finite so this number x of the sequence will have some prime p(of form (4n+3) ) as it's divisor but no prime from t1*t2*t3*t4.......tm equal to p as number x is omething like (ti*y-1) and ti cannot divide this number so p is not equal to any of the ti , hence there exist some p other than t1, t2, t3, t4.......tm which divides x .Hence our assumption is wrong that there are finite prime t1, t2, t3, t4.......tm in the sequence.  

  • Proof for (4k+2):

But for sequence (4k+2), we can rewrite it as 2*(2k+1), so for every term of this sequence we have 2 as a common factor that will result in 2 as factor of that number other than 1 and the number itself, which violates the definition of a prime number.

We can also confirm it by writing the series : 6(k=1), 10(k=2), 14(k=3), 18(k=4), 22(k=5), 26(k=6) ..................(A.P with first term as 6 and common difference as 4)

So all numbers in this sequence are even numbers which are not prime.

  • Hence the sequence (4k+3) contains infinite many prime and sequence (4k+2) does not contain any.

So if you still have any doubt regarding this solution please feel free to ask it in the comment section below and if it is helpful then please upvote this solution, THANK YOU.


Related Solutions

Prove this is true: The sequence {4k + 3} where k ∈ N contains infinitely many...
Prove this is true: The sequence {4k + 3} where k ∈ N contains infinitely many primes, but the sequence {4k + 2} does not.
Prove: There are infinitely many primes of the form 6n − 1 (n is an integer).
Prove: There are infinitely many primes of the form 6n − 1 (n is an integer).
Provide an example: 1) A sequence with infinitely many terms equal to 1 and infinitely many...
Provide an example: 1) A sequence with infinitely many terms equal to 1 and infinitely many terms that are not equal to 1 that is convergent. 2) A sequence that converges to 1 and has exactly one term equal to 1. 3) A sequence that converges to 1, but all of its terms are irrational numbers.
Prove that for an integer k, k2 + 4k + 6 is odd if and only...
Prove that for an integer k, k2 + 4k + 6 is odd if and only if k is odd.
Discrete math problem: Prove that there are infinitely many primes of form 4n+3.
Discrete math problem: Prove that there are infinitely many primes of form 4n+3.
Prove that the union of infinitely many countable sets is countable.
Prove that the union of infinitely many countable sets is countable.
prove that there exist infinitely many primitive Pythagorean triples
prove that there exist infinitely many primitive Pythagorean triples
Let {an}n∈N be a sequence with lim n→+∞ an = 0. Prove that there exists a...
Let {an}n∈N be a sequence with lim n→+∞ an = 0. Prove that there exists a subsequence {ank }k∈N so that X∞ k=1 |ank | ≤ 8
1.Prove that{2k+1:k∈N}∩{2k2 :k∈N}=∅. 2.Give two examples of ordered sets where the meaning of ” ≤ ”...
1.Prove that{2k+1:k∈N}∩{2k2 :k∈N}=∅. 2.Give two examples of ordered sets where the meaning of ” ≤ ” is not the same as the one used with the set of real numbers R.
Prove that there exist infinitely many positive real numbers r such that the equation 2x +...
Prove that there exist infinitely many positive real numbers r such that the equation 2x + 3y + 5z = r has no solution (x,y,z) ∈ Q × Q × Q. (Hint: Is the set S = {2x + 3y + 5z : (x,y,z) ∈ Q × Q × Q} countable?)
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT