Well it wouldn't, I had misunderstood you is all.
I thought you were talking about iterating modulo operators in the integers, that's the really hard part. That's the only part that would be crazy. Also, I'd doubt it'd help with many hard number theory problems--it would just be a very hard number theory problem, lol. I think our wires just got crossed is all.
But solving things like:
\[
p \mod x \mod y \mod x \mod y = n\\
\]
For large numbers and large primes would be crazy hard. Interesting. Not sure it would prove anything significant. It'd just be really hard, lol. When I said they'd probably give you a fields medal, it's just a joke that one of my profs would always say. If a problem was just unreasonably hard, it was always--they'd probably give you a fields medal if you solved this, lol.
I thought you were talking about iterating modulo operators in the integers, that's the really hard part. That's the only part that would be crazy. Also, I'd doubt it'd help with many hard number theory problems--it would just be a very hard number theory problem, lol. I think our wires just got crossed is all.
But solving things like:
\[
p \mod x \mod y \mod x \mod y = n\\
\]
For large numbers and large primes would be crazy hard. Interesting. Not sure it would prove anything significant. It'd just be really hard, lol. When I said they'd probably give you a fields medal, it's just a joke that one of my profs would always say. If a problem was just unreasonably hard, it was always--they'd probably give you a fields medal if you solved this, lol.