×

# Proof Contest Day 7

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

Note by Lakshya Sinha
1 year, 8 months ago

## Comments

Sort by:

Top Newest

Since Nobody posted the proof here is the proof:

· 1 year, 8 months ago

Log in to reply

What is the motivation behind this? How can one go about approaching this proof? Staff · 1 year, 8 months ago

Log in to reply

Well it helps in school unlike from brilliant here we have 3 chances. · 1 year, 8 months ago

Log in to reply

I do not understand your comment.

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}$$? Staff · 1 year, 8 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...