Proof of Legendre's conjecture

[Guest]

Hi Guys,
I'd like to share with you my proof of Legendre's conjecture, that there is always a prime between n^2 and (n+1)^2.
It's very simple and intuitive - based on the idea of patterns of divisibility of numbers.
What do you think about it?

https://youtu.be/Q4qpsdNugFk

Marcin