3 Jun
2020
3 Jun
'20
9:05 a.m.
On 01/06/2020 15:55, Simon Plouffe wrote:
sometime ago, someone came up with 26 primes in arith. progression. ... But what if the primes are in geometric progression instead like a(n) = { c^n } , where { } is the nearest integer.
Isn't there a famous theorem saying that with some form like { c^c^n } or {3^3^cn} or something of the kind you can get _only_ primes? -- g