For discussing Olympiad Level Number Theory problems
- Posts: 5
- Joined: Mon Apr 03, 2017 1:59 pm
Prove that for every prime $$p > 2$$,there exists a prime $$q < p$$ such that $$p-q = 2^n$$ for some $n \in N_0$.
Atonu Roy Chowdhury
- Posts: 63
- Joined: Fri Aug 05, 2016 7:57 pm
- Location: Chittagong, Bangladesh
Doesn't work when $p=127$.
This was freedom. Losing all hope was freedom.