Module N
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Euclid's Algorithm | 9/9 (100%) | 1.00 | 1.00 |
| B | Binary Exponentiation | 9/18 (50%) | 2.00 | 2.00 |
| C | Root of Minus One | 5/15 (33%) | 3.00 | 3.00 |
| D | Early Termination | 6/23 (26%) | 3.83 | 3.83 |
| E | Gauss Squares | 5/5 (100%) | 1.00 | 1.00 |
| F | Brahmagupta-Fibonacci | 5/7 (71%) | 1.40 | 1.40 |
| G | All Square Sums | 3/22 (14%) | 7.33 | 7.33 |
| H | Almost Pythagorean | 0/0 (0%) | -- | -- |