Does there exist an increasing sequence t 1 , t 2 , … such that for any integer constant c , the sequence
t 1 + c , t 2 + c , t 3 + c , …
contains only a finite number of primes?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
A simple example would be t n = 2 n − 1 and c = 1 . Since all t n + c will be even, then only the number 2 will be prime.
This is not a correct solution, since I have said for any integer constant c , not for a specific constant. In your case, if c = 2 , there will be infinitely many primes that satisfy.
Oh! Didn't notice that c may assume any value. Sorry for that!
Problem Loading...
Note Loading...
Set Loading...
A simple construction could be inspired by thinking that you want t n to be eventually divisible by c . With this in mind, we could try the sequence t n = n ! . However, if we have c = ± 1 , the sequence, may still contain infinite primes. However, we know that a 3 ± 1 is factorable. Thus, we could try the sequence t n = ( n ! ) 3 , which we would find to satisfy having finite primes.