Quantcast
[ 3 / biz / cgl / ck / diy / fa / g / ic / jp / lit / sci / tg / vr ] [ index / top / reports / report a bug ] [ 4plebs / archived.moe / rbt ]

Maintenance is complete! We got more disk space.
Become a Patron!

/sci/ - Science & Math

Search:


View post   

[ Toggle deleted replies ]
>> No.10572986 [View]
File: 1.13 MB, 535x301, tumblr.gif [View same] [iqdb] [saucenao] [google] [report]
10572986

Take a prime natural N
Subtract a prime natural X, where X < N
If N-X < X then add N to the difference and subtract X.
If you do this for N steps, you'll end up at 0.
I'm a brainlet and I don't understand this. I know it's because of modular arithmetic, but why does it always seem to come up to N steps with primes?



Navigation
View posts [+24] [+48] [+96]