Difference between revisions of "User:Chess64"
| (22 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | == | + | == Nontrivial Contributions == |
| − | + | === Algebra === | |
| − | + | * [[Trivial inequality]] | |
| + | * [[Completing the square]] | ||
| + | * [[Quadratic Equations]] | ||
| + | * [[Quadratic Formula]] | ||
| + | * [[Vieta's formulas]] | ||
| + | * [[Absolute value]] | ||
| − | [ | + | === Combinatorics === |
| + | |||
| + | * [[Combinatorics]] | ||
| + | * [[Combinations]] | ||
| + | * [[Combinatorial identities]] | ||
| + | * [[Complementary counting]] | ||
| + | * [[Casework]] | ||
| + | * [[Overcounting]] | ||
| + | * [[Geometric probability]] | ||
| + | * [[Constructive counting]] | ||
| + | * [[Principle of Inclusion-Exclusion]] | ||
| + | * [[Correspondence]] | ||
| + | * [[Recursion]] | ||
| + | * [[Generating functions]] | ||
| + | |||
| + | === Number Theory === | ||
| + | |||
| + | * [[Number theory]] | ||
| + | * [[Relatively prime]] | ||
| + | * [[Simon's Favorite Factoring Trick]] | ||
| + | * [[Modular arithmetic]] | ||
| + | * [[Fermat's Little Theorem]] | ||
| + | * [[Euler's totient function]] | ||
| + | * [[Euler's Totient Theorem]] | ||
| + | * [[Carmichael function]] | ||
| + | * [[Wilson's Theorem]] | ||
| + | * [[Euclid's proof of the infinitude of primes]] | ||
| + | |||
| + | === Proof Techniques === | ||
| + | |||
| + | * [[Proof by contradiction]] | ||
| + | * [[Pigeonhole Principle]] | ||
| + | |||
| + | === Olympiads === | ||
| + | |||
| + | ==== Canada (CMO) ==== | ||
| + | |||
| + | * [[Canadian Mathematical Olympiad]] | ||
| + | |||
| + | === Miscellaneous === | ||
| + | |||
| + | * [[Brute forcing]] | ||
| + | * [[LaTeX]] | ||
| + | * [[LaTeX:Layout]] | ||
Latest revision as of 00:37, 21 July 2008
Contents
Nontrivial Contributions
Algebra
- Trivial inequality
- Completing the square
- Quadratic Equations
- Quadratic Formula
- Vieta's formulas
- Absolute value
Combinatorics
- Combinatorics
- Combinations
- Combinatorial identities
- Complementary counting
- Casework
- Overcounting
- Geometric probability
- Constructive counting
- Principle of Inclusion-Exclusion
- Correspondence
- Recursion
- Generating functions
Number Theory
- Number theory
- Relatively prime
- Simon's Favorite Factoring Trick
- Modular arithmetic
- Fermat's Little Theorem
- Euler's totient function
- Euler's Totient Theorem
- Carmichael function
- Wilson's Theorem
- Euclid's proof of the infinitude of primes
