(no subject)

[oyceter]

GAAAAAAH 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.

Comments

[yhlee.livejournal.com]

Oh no! I remain available for consultation as needed. You are kind of getting the crash course version of it, I'm afraid. It's really beautiful if you're allowed time to see the whole thing kind of unfold.

[yhlee.livejournal.com]

Oh! If you are on the Euler function proof that I think you are on, consider this simpler question: When p is prime, what is φ(p)?

[yhlee.livejournal.com]

D'oh. I think I have the wrong Greek letter. Φ? Phi, anyway.

[oyceter]

Hee!

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!