Twin Primes and a Primality Test by Indivisibility
M. Chaves
Abstract
In Wilson's Theorem the primality of a number hinges on a congruence. We present a similar test where the primality of a number m hinges, instead, on the indivisibility of 4(m-5)! by m. One implication of this theorem is a necessary and sufficient condition for two numbers to be twin primes, a result reminiscent of Clement's theorem but involving indivisibility. MSC: 11A41 and 11A51.
Create a lesson
Related papers
An ergodic approach to equations of the form x+y=α(n)
Vitaly Bergelson, Hao Pan, Saúl Rodríguez Martín
Rogers--Ramanujan identities from the geometry of Xa=Yb
Yifeng Huang, Kenny Lau, Ken Ono
Computational results on sums of a prime with squares or cubes
Kenny Applegate, Kyle Pratt
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Jean-Marc Sac-Épée, Souad El Otmani, Armand Maul et al.
Low moments of automorphic random multiplicative function sums
Sun-Kai Leung
A problem of Yang and Chen on weighted representation functions
Shuang-Shuang Li, Ya-Ting Xu, Xiao-Hui Yan