---

Development of Algorithmic Constructions

12:04:00 19.Apr 2024

---

Polynom = x^2-56x+151

1. Algorithm

a:=1;
b:=-56;
c:=151;


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-56x+151

f(0)=151
f(1)=3
f(2)=43
f(3)=1
f(4)=19
f(5)=13
f(6)=149
f(7)=1
f(8)=233
f(9)=17
f(10)=103
f(11)=1
f(12)=29
f(13)=1
f(14)=23
f(15)=1
f(16)=163
f(17)=1
f(18)=41
f(19)=1
f(20)=569
f(21)=73
f(22)=199
f(23)=1
f(24)=617
f(25)=1
f(26)=37
f(27)=79
f(28)=211
f(29)=1
f(30)=1
f(31)=1
f(32)=1
f(33)=1
f(34)=1
f(35)=1
f(36)=1
f(37)=1
f(38)=1
f(39)=1
f(40)=1
f(41)=1
f(42)=1
f(43)=1
f(44)=1
f(45)=1
f(46)=1
f(47)=1
f(48)=1
f(49)=1
f(50)=1
f(51)=1
f(52)=1
f(53)=1
f(54)=1
f(55)=1
f(56)=1
f(57)=1
f(58)=89
f(59)=1
f(60)=1
f(61)=1
f(62)=523
f(63)=1
f(64)=1
f(65)=1
f(66)=811
f(67)=1
f(68)=967
f(69)=131
f(70)=1
f(71)=1
f(72)=1303
f(73)=1
f(74)=1483
f(75)=197
f(76)=557
f(77)=1
f(78)=1867
f(79)=1
f(80)=109
f(81)=1
f(82)=761
f(83)=1
f(84)=2503
f(85)=1
f(86)=2731
f(87)=1
f(88)=1
f(89)=193
f(90)=1
f(91)=139
f(92)=3463
f(93)=449
f(94)=1
f(95)=241
f(96)=307
f(97)=1
f(98)=251
f(99)=1

b) Substitution of the polynom
The polynom f(x)=x^2-56x+151  could be written as f(y)= y^2-633 with x=y+28

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-28
f'(x)>2x-57  with x > 25

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 : 151, 3, 43, 1, 19, 13, 149, 1, 233, 17, 103, 1, 29, 1, 23, 1, 163, 1, 41, 1,
Found in Database : 151, 3, 43, 19, 13, 149, 233, 17, 103, 29, 23, 163, 41, 569, 73, 199, 617, 37, 79, 211,
Found in Database : 3, 13, 17, 19, 23, 29, 37, 41, 43, 73, 79, 89, 103, 109, 131, 139, 149,