Nombre de r\'esidus quadratiques d'un nombre entier inf\'erieurs \`a sa moiti\'e

TL;DR

This paper introduces a new criterion based on counting small quadratic residues to distinguish prime numbers from composite numbers, providing a potentially efficient primality test.

Contribution

The paper presents a novel criterion utilizing quadratic residue counts to identify prime numbers, offering an alternative to existing primality tests.

Findings

The criterion effectively differentiates primes from composites.

It relies on counting small quadratic residues.

Potential for computational efficiency in primality testing.

Abstract

We propose a criterion that allows one to distinguish prime numbers from compound ones. This criterion is based on the counting of small quadratic residues.