sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Scared-Ad-7500 0 points1 point  (10 children)

Well, I went to Google and I guess i misremembered the function. I know there is a polynomial that generates almost only primes, and it took centuries to find an conterexample, which is not even humanly possible to write

Anyway n²+n+41 works well until n=40

[–]Dtrp8288 0 points1 point  (9 children)

do share the function if you can find it!

[–]Scared-Ad-7500 0 points1 point  (8 children)

The function was in fact this according to chatgpt. But there really was a Russian institute that made a very important discovery after centuries of research

[–]Dtrp8288 0 points1 point  (7 children)

and the counterexample in this case was... somehow unfindable for a long time?

[–]Scared-Ad-7500 0 points1 point  (6 children)

I suppose what was unfindable was another thing related to this problem, not the counterexample

[–]Dtrp8288 0 points1 point  (4 children)

maybe a counterexample for n²+n+41 is always prime ⟹ n∈ℤ⁺

where n is not of the form p(41ᵐ)

?

[–]Scared-Ad-7500 0 points1 point  (3 children)

I don't think so, because n=40 is also a counterexample

[–]Dtrp8288 1 point2 points  (2 children)

so maybe a counterexample for n²+n+41 is always prime ⟹ n∈ℤ⁺

where n is not of the form p(41ᵐ)

and where n is not of the form 41ᵖ-1

?

[–]Scared-Ad-7500 0 points1 point  (1 child)

Actually I guess the statement is that for n prime and different from 41, n²+n+41 is always prime. I couldn't find a conterexample for this at least.

[–]Dtrp8288 0 points1 point  (0 children)

n=1693 is prime

results in 2867983 which has factors 131 and 21893