Green-Tao Theorem?

Does there exist an increasing sequence t 1 , t 2 , t_1, t_2, \ldots such that for any integer constant c c , the sequence

t 1 + c , t 2 + c , t 3 + c , t_1+c, t_2+c, t_3+c, \ldots

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.

2 solutions

Sharky Kesa
Mar 13, 2016

A simple construction could be inspired by thinking that you want t n t_n to be eventually divisible by c c . With this in mind, we could try the sequence t n = n ! t_n = n! . However, if we have c = ± 1 c=\pm 1 , the sequence, may still contain infinite primes. However, we know that a 3 ± 1 a^3 \pm 1 is factorable. Thus, we could try the sequence t n = ( n ! ) 3 t_n = (n!)^3 , which we would find to satisfy having finite primes.

Efren Medallo
Sep 15, 2016

A simple example would be t n = 2 n 1 t_n = 2n-1 and c = 1 c=1 . Since all t n + c t_n + c will be even, then only the number 2 2 will be prime.

This is not a correct solution, since I have said for any integer constant c c , not for a specific constant. In your case, if c = 2 c=2 , there will be infinitely many primes that satisfy.

Sharky Kesa - 4 years, 9 months ago

Oh! Didn't notice that c c may assume any value. Sorry for that!

Efren Medallo - 4 years, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...