Prove that there exist inﬁnitely many positive integers \(n\) such that \(n^2+1\) has a prime divisor greater than \(2n +\sqrt{2n}\).

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

## Comments

Sort by:

TopNewestSince Nobody posted the proof here is the proof:

– Lakshya Sinha · 8 months, 3 weeks agoLog in to reply

– Calvin Lin Staff · 8 months, 2 weeks ago

What is the motivation behind this? How can one go about approaching this proof?Log in to reply

– Lakshya Sinha · 8 months, 2 weeks ago

Well it helps in school unlike from brilliant here we have 3 chances.Log in to reply

I am asking how one can motivate finding the proof to this problem. An understanding of the problem should also provide some insight into why the solution has a certain approach to it, and motivate why someone should consider such a solution.

Currently, this solution is like "magic", where while the individual steps are explained, it is not clear why we chose them, or why these steps work. For example, why do we look at \( p\equiv 1 \pmod{8} \)? What is it about \( n^2 + 1 \) that tells us about prime divisors of the form \( p \equiv 1 \pmod{8} \)? – Calvin Lin Staff · 8 months, 2 weeks ago

Log in to reply