(New page: Category:MA453Spring2009Walther My favorite theorem is the fundamental theorem of MA 453. It states that no matter what one posts one Rhea, one will receive credit.) |
|||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
[[Category:MA453Spring2009Walther]] | [[Category:MA453Spring2009Walther]] | ||
| − | My favorite theorem is the fundamental theorem of MA 453. It states that no matter what one posts | + | My favorite theorem is the fundamental theorem of MA 453. It states that no matter what one posts on Rhea, one will receive credit. |
| + | |||
| + | --- | ||
| + | |||
| + | I really don't have anything to contribute elsewhere, so I guess I will expand this page for my credit this week. | ||
| + | |||
| + | For a serious note, I like Fermat's Little Theorem. It states, If p is a prime number and a is a natural number that is not a multiple of p then a^(p-1) ≡ 1 (mod p). I learned this in my cryptography class last semester and it was really handy. I also like how it is his "little" theorem. | ||
| + | |||
| + | --[[User:Aschuett|Aschuett]] 22:52, 5 February 2009 (UTC) | ||
Latest revision as of 17:52, 5 February 2009
My favorite theorem is the fundamental theorem of MA 453. It states that no matter what one posts on Rhea, one will receive credit.
---
I really don't have anything to contribute elsewhere, so I guess I will expand this page for my credit this week.
For a serious note, I like Fermat's Little Theorem. It states, If p is a prime number and a is a natural number that is not a multiple of p then a^(p-1) ≡ 1 (mod p). I learned this in my cryptography class last semester and it was really handy. I also like how it is his "little" theorem.
--Aschuett 22:52, 5 February 2009 (UTC)
