contest_2011-09-27
Differences
This shows you the differences between two versions of the page.
Next revision | Previous revisionLast revisionBoth sides next revision | ||
contest_2011-09-27 [2011/09/22 12:50] – created jtkorb | contest_2011-09-27 [2011/09/27 06:02] – jtkorb | ||
---|---|---|---|
Line 10: | Line 10: | ||
===== Problems ===== | ===== Problems ===== | ||
- | * A: [[http:// | + | * A: [[http:// |
+ | * B: [[Prelude One to Carmichael Numbers -- Primality Testing]] | ||
+ | * C: [[Prelude Two to Carmichael Numbers -- Efficient Power Mod]] | ||
+ | * D: [[http:// | ||
+ | * E: [[http:// | ||
+ | * F: [[Prelude to Factovisors]] | ||
+ | * G: [[http:// | ||
+ | * H: [[http:// | ||
// | // | ||
Line 16: | Line 23: | ||
**Hints:** | **Hints:** | ||
- | * A: One solution is to create a mapping from mistyped characters to the corresponding correct character. | + | * A: Find a pattern. |
+ | * B: Repeated divisions is fine (be sure to skip even numbers after 2 and only test as large as necessary). | ||
+ | * C: Observe that, if '' | ||
+ | * D: Combine the two preludes. | ||
+ | * E: The Extended Euclid Algorithm for GCD (given in the text), given in the text, solves this problem directly. | ||
+ | * F: Brute force factorization is fine. You'll want to keep a table of '' | ||
+ | * G: Theorem: The highest power of '' | ||
+ | * H: Use the Diophantine solution method in the text. |
contest_2011-09-27.txt · Last modified: 2011/09/27 11:00 by jtkorb