Problems about primes, from easy to Fields medal with tiny tweaks
Вставка
- Опубліковано 10 лют 2025
- In this video we talk about six different problems about primes numbers, some of which are easy to solve, and some of them are very important open problems in number theory #math #numbertheory #primenumber #challenge #stem #conjecture
Cool that the slightest changes in a problem make it go from easily solved to crazy difficult. 😮 Excellent presentation!
Got everything right except (e)... saw that one as a Pell equation like (f), but didn't even notice that you can just look at it mod 4 and then it's easy.
I started the video and immediately paused thinking that undoable ones will be at the end and went on for like half an hour on the second one 😅
Yipee I was right on the previous video
@@captainsnake8515 👏👏👏
¿Qué diferencia hay entre la conjetura de Chowla-Mahler (recientemente demostrado por Pastén) y la conjectura de Hardy-Littlewood?
Is that a Hagoromo chalk?
@@NoNTr1v1aL 100% ... There is a Hagoromo discount code in the Linktree in my profile!
1:52 how does this conclude p=2?
Since both n+1 and n-1 are even, we can say that atleast one of them is a multiple of 4, so in the factorisation of RHS there will certainly be an 8
This implies that p is even and the only even prime is 2