Primality test for numbers M with a large power of 5 dividing M4- 1

  • Authors:

  • Pedro Berrizbeitia;Mauricio Odremán;Juan Tena Ayuso

  • Affiliations:

  • Departamento de Matemáticas, Universidad Simón Bolivar, Caracas 1080-A, Venezuela;Departamento de Matemáticas, Universidad Simón Bolivar, Caracas 1080-A, Venezuela;Facultad de Ciencias, Universidad de Valladolid, Valladolid, Spain

  • Venue:
  • Theoretical Computer Science - Latin American theoretical informatics
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Quintic Reciprocity Law is used to produce an algorithm, that runs in polynomial time, and that determines the primality of numbers M, such that M4 - 1, is divisible by a power of 5 which is larger that √M, provided that a small prime p, p ≡ 1 (mod 5) is given, such that M, is not a fifth power modulo p. The same test equations are used for all such M.A sufficiency test, together with its probability of succeeding in determining primality is given when the condition on M modulo p is omitted.