Formalizing a Diophantine Representation of the Set of Prime Numbers

04/26/2022
by   Karol Pąk, et al.
0

The DPRM (Davis-Putnam-Robinson-Matiyasevich) theorem is the main step in the negative resolution of Hilbert's 10th problem. Almost three decades of work on the problem have resulted in several equally surprising results. These include the existence of diophantine equations with a reduced number of variables, as well as the explicit construction of polynomials that represent specific sets, in particular the set of primes. In this work, we formalize these constructions in the Mizar system. We focus on the set of prime numbers and its explicit representation using 10 variables. It is the smallest representation known today. For this, we show that the exponential function is diophantine, together with the same properties for the binomial coefficient and factorial. This formalization is the next step in the research on formal approaches to diophantine sets following the DPRM theorem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/02/2022

An improvement to a result about graph isomorphism networks using the prime factorization theorem

The unique prime factorization theorem is used to show the existence of ...
research
03/09/2022

Primality Tests and Prime Certificate

This note presents a formalisation done in Coq of Lucas-Lehmer test and ...
research
01/11/2020

On Polynomial Modular Number Systems over Z/pZ

Polynomial Modular Number System (PMNS) is a convenient number system fo...
research
11/22/2020

On algorithms to find p-ordering

The concept of p-ordering for a prime p was introduced by Manjul Bhargav...
research
12/10/2019

On the Complexity of Modulo-q Arguments and the Chevalley-Warning Theorem

We study the search problem class PPA_q defined as a modulo-q analog of ...
research
05/25/2019

Solutions of x^q^k+...+x^q+x=a in GF2^n

Though it is well known that the roots of any affine polynomial over a f...
research
12/10/2020

No Krasnoselskii number for general sets in ℝ^2

For a family ℱ of sets in ℝ^d, the Krasnoselskii number of ℱ is the smal...

Please sign up or login with your details

Forgot password? Click here to reset