top of page
GitHub Repository
![Extension of the problem a*b is unique for a,b in [n^2... (n+1)^2-1]](https://static.wixstatic.com/media/80fd94_19c8f44555264a4e995a65512a546ec0~mv2.png/v1/fill/w_797,h_598,fp_0.50_0.50,q_35,blur_30,enc_avif,quality_auto/80fd94_19c8f44555264a4e995a65512a546ec0~mv2.png)
![Extension of the problem a*b is unique for a,b in [n^2... (n+1)^2-1]](https://static.wixstatic.com/media/80fd94_19c8f44555264a4e995a65512a546ec0~mv2.png/v1/fill/w_797,h_598,fp_0.50_0.50,q_95,enc_avif,quality_auto/80fd94_19c8f44555264a4e995a65512a546ec0~mv2.png)
Extension of the problem a*b is unique for a,b in [n^2... (n+1)^2-1]
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 ......
Istvan Benedek
Jan 24, 20242 min read
39 views
0 comments
Number pyramid
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...
Istvan Benedek
Jan 13, 20241 min read
24 views
0 comments
Divisible by 7
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....
Istvan Benedek
Jan 10, 20241 min read
28 views
0 comments
bottom of page