(no subject)
Tue, Feb. 27th, 2007 11:22 pmGAAAAAAH modular math proofs I hate you! Hate! Yes! Ditto for all you Euler function proofs and prime numbers!
If I never have to think about remainders again, it will be too soon.
Alas, I must continue to wrack my brain to turn this thing in on Friday, DOOM.
I give up for now and go to watch Heroes.
If I never have to think about remainders again, it will be too soon.
Alas, I must continue to wrack my brain to turn this thing in on Friday, DOOM.
I give up for now and go to watch Heroes.
Tags:
(no subject)
Wed, Feb. 28th, 2007 07:30 pm (UTC)I think I sort of get the Euler function one? Since p is prime, all numbers from 1 through p-1 are solutions. It's the p^k thing that screws me up. I mean, I am guessing since p is prime, p^k means that the only factors are p, so all numbers from 1 through (p^k)-1 with the exception of p^(k-1), p^(k-2)....
Maybe?
Woe.
Also, all the mod proofs are messing with my head. Sigh. As is that stupid circle one, but I'm not even thinking about that yet.
By the way, you rock so much!