In: Computer Science
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.
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.
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.
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.
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.