GitHub Repository

I have recently found this mathematical statement of Pál Erdős: If we take two arbitrary numbers, a and b, from the range of [n^2 ......

Here is the code for building up a number pyramid where the line goes from n^2+1 up to (n+1)^2 and the output looks like this (primes are...

I've just bumped into an interesting method to figure out if p is congruent to 0 modulo 7. So let's take a 3-digit number 378, e.g....