contest_2011-09-27
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
contest_2011-09-27 [2011/09/25 12:48] – jtkorb | contest_2011-09-27 [2011/09/27 11:00] (current) – jtkorb | ||
---|---|---|---|
Line 27: | Line 27: | ||
* C: Observe that, if '' | * C: Observe that, if '' | ||
* D: Combine the two preludes. | * D: Combine the two preludes. | ||
- | * E: The GCD algorithm | + | * E: The Extended Euclid Algorithm for GCD (given in the text), given in the text, solves this problem directly. |
- | * F: | + | * F: Brute force factorization is fine. You'll want to keep a table of '' |
* G: Theorem: The highest power of '' | * G: Theorem: The highest power of '' | ||
- | * H: Use the Diophantine solution method | + | * H: The text suggests using the Diophantine solution method |
contest_2011-09-27.txt · Last modified: 2011/09/27 11:00 by jtkorb