Module N
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Euclid's Algorithm | 13/13 (100%) | 1.00 | 1.00 |
| B | Binary Exponentiation | 13/23 (57%) | 1.77 | 1.77 |
| C | Root of Minus One | 13/35 (37%) | 2.69 | 2.69 |
| D | Early Termination | 13/45 (29%) | 3.46 | 3.46 |
| E | Gauss Squares | 12/12 (100%) | 1.00 | 1.00 |
| F | Brahmagupta-Fibonacci | 11/17 (65%) | 1.55 | 1.55 |
| G | All Square Sums | 6/58 (10%) | 8.29 | 9.50 |
| H | Almost Pythagorean | 0/1 (0%) | 1.00 | -- |