---

Development of Algorithmic Constructions

16:01:53 19.Apr 2024

---

Polynom = x^2-140x+587

1. Algorithm

a:=1;
b:=-140;
c:=587;


liste_max:=100000;

sieving:=proc (stelle, p)
begin
   while (stelle<=liste_max) do
     erg:=liste[stelle];
     while(erg mod p=0) do
        // Divison of the stored f(x) by the prime
        erg:=erg /p;
     end_while;
     liste[stelle]:=erg;
     stelle:=stelle+p;
   end_while;
end_proc;

// Calculation of the values of the polynom for x from 0 to liste_max
for x from 0 to liste_max do
   p:=abs (a*x^2+b*x+c);
   while (p mod 2=0) p:=p/2;
   liste [x]:=p;
end_for;

for x from 0 to liste_max do
    p:=liste[x];

    if (p>1) then

      // Printing the Primes
      print (x, p);

      // 1. Sieving
      sieving (x+p,  p);

      t:=(-x-b/a) mod p;
      if t=0 then t:=p; end_if;

      // 2. Sieving
      sieving (t, p);

    end_if;

end_for;

 2. Mathematical background
Lemma: If p | f(x) then also p | f(x+p) and  p | f(-x-b/a)

a)  p | f(x)   <=> ax^2 + bx + c = 0                       mod p
    p | f(x+p) <=> a(x+p)^2 + b(x+p) + c = 0               mod p
               <=> ax^2 + 2axp + ap^2 + bx + bp + c = 0    mod p
               <=> ax^2 + bx + c = 0                       mod p

    Thus if p | f(x) then p | f(x+p)

b)  if b = 0 mod a
    p | f(x)       <=> ax^2 + bx + c = 0                         mod p
    p | f(-x-b/a)  <=> a(-x-b/a)^2 + b(-x-b/a) + c = 0           mod p
                   <=> ax^2 + 2bx + b^2/a - bx - b^2/a + c = 0   mod p
                   <=> ax^2 + bx + c = 0                         mod p

    Thus if p | f(x)  then p | f(-x-b/a)



 3. Correctness of the algorithm
The proof for this polynom is similar to the proof for the polynom f(x)=x^2-4x+1.

a) First terms for the polynom f(x) = x^2-140x+587

f(0)=587
f(1)=7
f(2)=311
f(3)=11
f(4)=43
f(5)=1
f(6)=31
f(7)=1
f(8)=67
f(9)=37
f(10)=23
f(11)=13
f(12)=73
f(13)=19
f(14)=107
f(15)=1
f(16)=127
f(17)=47
f(18)=1609
f(19)=1
f(20)=1
f(21)=239
f(22)=41
f(23)=263
f(24)=1
f(25)=1
f(26)=2377
f(27)=1
f(28)=2549
f(29)=1
f(30)=2713
f(31)=349
f(32)=151
f(33)=1
f(34)=431
f(35)=193
f(36)=1
f(37)=1
f(38)=1
f(39)=419
f(40)=3413
f(41)=1
f(42)=3529
f(43)=1
f(44)=3637
f(45)=461
f(46)=101
f(47)=1
f(48)=547
f(49)=1
f(50)=1
f(51)=1
f(52)=3989
f(53)=503
f(54)=4057
f(55)=1
f(56)=179
f(57)=1
f(58)=379
f(59)=131
f(60)=383
f(61)=1
f(62)=607
f(63)=1
f(64)=1
f(65)=1
f(66)=4297
f(67)=269
f(68)=139
f(69)=1
f(70)=227
f(71)=1
f(72)=1
f(73)=1
f(74)=1
f(75)=1
f(76)=1
f(77)=1
f(78)=1
f(79)=1
f(80)=1
f(81)=1
f(82)=1
f(83)=1
f(84)=1
f(85)=1
f(86)=1
f(87)=1
f(88)=1
f(89)=1
f(90)=1
f(91)=1
f(92)=1
f(93)=1
f(94)=1
f(95)=1
f(96)=1
f(97)=1
f(98)=1
f(99)=1

b) Substitution of the polynom
The polynom f(x)=x^2-140x+587  could be written as f(y)= y^2-4313 with x=y+70

c) Backsubstitution

Beside by backsubstitution you get an estimation for the huge of the primes with p | f(x) and p < f(x)

f'(y)>(2y-1) with with y=x-70
f'(x)>2x-141  with x > 66

4. Infinity of the sequence

5. Sequence of the polynom with 1

6. Sequence of the polynom (only primes)

7. Distribution of the primes

8. Check for existing Integer Sequences by OEIS

Found in Database : 587, 7, 311, 11, 43, 1, 31, 1, 67, 37, 23, 13, 73, 19, 107, 1, 127, 47, 1609, 1,
Found in Database : 587, 7, 311, 11, 43, 31, 67, 37, 23, 13, 73, 19, 107, 127, 47, 1609, 239, 41, 263, 2377, 2549, 2713, 349, 151, 431, 193, 419,
Found in Database : 7, 11, 13, 19, 23, 31, 37, 41, 43, 47, 67, 73, 101, 107, 127, 131, 139,