Prime representing polynomial

DOI10.2478/forma-2021-0020zbMath1494.68304OpenAlexW4285326687MaRDI QIDQ2171524

Karol Pąk

Publication date: 9 September 2022

Published in: Formalized Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/forma-2021-0020

zbMATH Keywords

Diophantine equationpolynomial reductionprime number

Mathematics Subject Classification ID

Counting solutions of Diophantine equations (11D45) Formalization of mathematics in connection with theorem provers (68V20)

Related Items (2)

On bag of 1. I ⋮ Introduction to algebraic geometry

Cites Work

• Gaussian integers
• Proth numbers
• Prime factorization of sums and differences of two like powers
• Further results on Hilbert's tenth problem
• Primes are nonnegative values of a polynomial in 10 variables
• The role of the Mizar mathematical library for interactive proof development in Mizar
• The Matiyasevich theorem. Preliminaries
• Diophantine sets. II
• Formalization of the MRDP theorem in the Mizar system
• Mizar: State-of-the-art and Beyond
• Universal diophantine equation
• Diophantine Representation of the Set of Prime Numbers
• Diophantine representation of Mersenne and Fermat primes
• Reduction of an arbitrary diophantine equation to one in 13 unknowns

This page was built for publication: Prime representing polynomial