---

Development of Algorithmic Constructions

10:31:34 20.Apr 2024

---

Polynom = x^2-114x+107

1. Algorithm

a:=1;
b:=-114;
c:=107;


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-114x+107

f(0)=107
f(1)=3
f(2)=13
f(3)=113
f(4)=37
f(5)=73
f(6)=541
f(7)=1
f(8)=19
f(9)=419
f(10)=311
f(11)=1
f(12)=1117
f(13)=67
f(14)=431
f(15)=53
f(16)=487
f(17)=257
f(18)=1621
f(19)=283
f(20)=197
f(21)=71
f(22)=1
f(23)=331
f(24)=2053
f(25)=353
f(26)=727
f(27)=59
f(28)=1
f(29)=131
f(30)=127
f(31)=137
f(32)=839
f(33)=1283
f(34)=1
f(35)=443
f(36)=1
f(37)=457
f(38)=103
f(39)=1409
f(40)=317
f(41)=1
f(42)=2917
f(43)=491
f(44)=991
f(45)=1499
f(46)=1
f(47)=1
f(48)=3061
f(49)=1
f(50)=1031
f(51)=1553
f(52)=1039
f(53)=521
f(54)=241
f(55)=523
f(56)=349
f(57)=1571
f(58)=1
f(59)=1
f(60)=1
f(61)=1
f(62)=1
f(63)=1
f(64)=1
f(65)=1
f(66)=1
f(67)=1
f(68)=1
f(69)=1
f(70)=1
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-114x+107  could be written as f(y)= y^2-3142 with x=y+57

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

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 : 107, 3, 13, 113, 37, 73, 541, 1, 19, 419, 311, 1, 1117, 67, 431, 53, 487, 257, 1621, 283,
Found in Database : 107, 3, 13, 113, 37, 73, 541, 19, 419, 311, 1117, 67, 431, 53, 487, 257, 1621, 283, 197, 71, 331, 2053, 353, 727, 59, 131, 127, 137, 839, 1283, 443, 457, 103, 1409,
Found in Database : 3, 13, 19, 37, 53, 59, 67, 71, 73, 103, 107, 113, 127, 131, 137,