Online dating paradox of choice
21) Hypercomplex numbers 22) Diophantine application: Cole numbers 23) Perfect Numbers: Perfect numbers are the sum of their factors (apart from the last factor). 24) Euclidean algorithm for GCF 25) Palindrome numbers: Palindrome numbers are the same backwards as forwards.
26) Fermat’s little theorem: If p is a prime number then a^p – a is a multiple of p.
The twin prime conjecture states that there are infinitely many consecutive primes ( eg. There has been a recent breakthrough in this problem.
The 2 hardest levels – Level 6 and Level 7 are particularly tough – are you good enough to crack them?