If n is a positive integer, what is the maximum possible number of prime numbers in the following sequences: n + 1, n + 2, n + 3, n + 4, n + 5, and n + 6? Options: A) 2 B) 3 C) 4 D) 5 E) 6
for n=1,   the numbers are 2,3,4,5,6,7   out if these 2,3,5,7 these 4 are prime numbers.   now for any value of n &gt;1 all six consecutive numbers will be 3 odd and 3 even. so at max we will get 3 prime numbers(assuming all the odd numbers are prime)   so the ans is 4   ANSWER:4
<result>C</result>
If n is a positive integer, what is the maximum possible number of prime numbers in the following sequences: n + 1, n + 2, n + 3, n + 4, n + 5, and n + 6?