<!DOCTYPE html>
<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body text="#000000" bgcolor="#f9f9fa">
<p>Uit mijn maelstroom.pdf:</p>
<p><br>
</p>
<p>On the properties of the Prime Numbers and the ‘Dlonier’
difference<br>
<br>
August 22, 2023<br>
</p>
<p><b>Method:</b><br>
1. Generate the first prime numbers below 100,000,000 (arbitrary
large number)<br>
2. Write them to a file with the following layout only if (P’ –
pn) < 0:</p>
<p>• linenumber = pn (nth prime)<br>
• prime number P<br>
• P’ with the digits of P reversed<br>
• <b>P’ – pn (which I call the Dlonier difference)</b><br>
<br>
</p>
<p>The formula to reverse the digits of a number can be expressed
as:<br>
P’ = 0<br>
while P>0:<br>
digit = P mod 10<br>
P’ = P’ × 10+digit<br>
P = P ÷ 10<br>
</p>
<p>In this formula:<br>
• P represents the original number.<br>
• P’ represents the reversed number.<br>
• \mod represents the modulo operation (remainder when dividing).<br>
• ÷ represents the division operation.<br>
</p>
<p><b>Conjecture:</b><br>
There are no more negative numbers for (P’ – pn) for n>17 and n
∈ ℕ<br>
or<br>
There are no more Dlonier differences for n>17 and n ∈ ℕ</p>
<p><br>
</p>
<p><img src="cid:part1.tmEQaQe4.ZtTXq3aZ@gmail.com" alt=""></p>
<p></p>
</body>
</html>