User:Temperal/The Problem Solver's Resource8

< User:Temperal
Revision as of 22:04, 5 October 2007 by Xpmath (talk | contribs) (<span style="font-size:20px; color: blue;">Intermediate Number Theory</span>)



The Problem Solver's Resource
Introduction Other Tips and Tricks Methods of Proof You are currently viewing page 8.

Intermediate Number Theory

These are more complex number theory theorems that may turn up on the USAMO or Pre-Olympiad tests. This will also cover diverging and converging series, and other such calculus-related topics.

Useful facts and Formulas

All quadratic resiues are 0 or 1$\pmod{4}$and 0,1, or 4 $\pmod{8}$. Fermat-Euler Identitity-If $gcd(a,m)=1$, then $a^{\phi{m}}\equiv1\pmod{m}$, where $\phi{m}$ is the number of relitvely prime numbers lower than $m$.


Back to page 7 | Continue to page 9