AI Chat AI Image Generator AI Video Text to Speech

Primality Tests and Prime Certificate

03/09/2022

∙

by Laurent Théry, et al.

∙

∙

This note presents a formalisation done in Coq of Lucas-Lehmer test and Pocklington certificate for prime numbers. They both are direct consequences of Fermat little theorem. Fermat little theorem is proved using elementary group theory and in particular Lagrange theorem.

Laurent Théry
6 publications
Sophia Antipolis
1 publication

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 ...

0 Rahul Sarkar, et al. ∙

research

∙ 11/22/2017

A note on recent criticisms to Birnbaum's theorem

In this note, we provide critical commentary on two articles that cast d...

0 Víctor Peña, et al. ∙

research

∙ 04/26/2022

Formalizing a Diophantine Representation of the Set of Prime Numbers

The DPRM (Davis-Putnam-Robinson-Matiyasevich) theorem is the main step i...

0 Karol Pąk, et al. ∙

research

∙ 01/18/2019

Boolean lifting property in quantales

In ring theory, the lifting idempotent property (LIP) is related to some...

0 Daniela Cheptea, et al. ∙

research

∙ 09/17/2023

On the Connection Between Riemann Hypothesis and a Special Class of Neural Networks

The Riemann hypothesis (RH) is a long-standing open problem in mathemati...

0 Soufiane Hayou, et al. ∙

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 ...

0 Mika Göös, et al. ∙

research

∙ 04/27/2021

Finding discrete logarithm in F_p^*

Difficulty of calculation of discrete logarithm for any arbitrary Field ...

0 Rajeev Kumar, et al. ∙