Higgs prime

Last updated April 14, 2021

A Higgs prime, named after Denis Higgs, is a prime number with a totient (one less than the prime) that evenly divides the square of the product of the smaller Higgs primes. (This can be generalized to cubes, fourth powers, etc.) To put it algebraically, given an exponent a, a Higgs prime Hp_n satisfies

\phi (Hp_{n})|\prod _{i=1}^{n-1}{Hp_{i}}^{a}{\mbox{ and }}Hp_{n}>Hp_{n-1}

where Φ(x) is Euler's totient function.

For squares, the first few Higgs primes are 2, 3, 5, 7, 11, 13, 19, 23, 29, 31, 37, 43, 47, ... (sequence A007459 in the OEIS ). So, for example, 13 is a Higgs prime because the square of the product of the smaller Higgs primes is 5336100, and divided by 12 this is 444675. But 17 is not a Higgs prime because the square of the product of the smaller primes is 901800900, which leaves a remainder of 4 when divided by 16.

From observation of the first few Higgs primes for squares through seventh powers, it would seem more compact to list those primes that are not Higgs primes:

Exponent	75th Higgs prime	Not Higgs prime below 75th Higgs prime
2	797	17, 41, 73, 83, 89, 97, 103, 109, 113, 137, 163, 167, 179, 193, 227, 233, 239, 241, 251, 257, 271, 281, 293, 307, 313, 337, 353, 359, 379, 389, 401, 409, 433, 439, 443, 449, 457, 467, 479, 487, 499, 503, 521, 541, 563, 569, 577, 587, 593, 601, 613, 617, 619, 641, 647, 653, 673, 719, 739, 751, 757, 761, 769, 773
3	509	17, 97, 103, 113, 137, 163, 193, 227, 239, 241, 257, 307, 337, 353, 389, 401, 409, 433, 443, 449, 479, 487
4	409	97, 193, 257, 353, 389
5	389	193, 257
6	383	257
7	383	257

Observation further reveals that a Fermat prime $2^{2^{n}}+1$ can't be a Higgs prime for the ath power if a is less than 2ⁿ.

It's not known if there are infinitely many Higgs primes for any exponent a greater than 1. The situation is quite different for a = 1. There are only four of them: 2, 3, 7 and 43 (a sequence suspiciously similar to Sylvester's sequence). Burris & Lee (1993) found that about a fifth of the primes below a million are Higgs prime, and they concluded that even if the sequence of Higgs primes for squares is finite, "a computer enumeration is not feasible."

Related Research Articles

In number theory, an arithmetic, arithmetical, or number-theoretic function is for most authors any function f(n) whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of n".

In number theory, a multiplicative function is an arithmetic function f(n) of a positive integer n with the property that f(1) = 1 and whenever a and b are coprime, then

Eulers totient function Gives the number of integers relatively prime to its input

In number theory, Euler's totient function counts the positive integers up to a given integer $n$ that are relatively prime to $n$ . It is written using the Greek letter phi as $or, and may also be called Euler's phi function . In other words, it is the number of integers k in the range 1 \leq k \leq n for which the greatest common divisor gcd(n, k) is equal to 1. The integers k of this form are sometimes referred to as totatives of n .$

Fermat's little theorem states that if $p$ is a prime number, then for any integer $a$ , the number $a p - a$ is an integer multiple of $p$ . In the notation of modular arithmetic, this is expressed as

In number theory, Euler's theorem states that if n and a are coprime positive integers, then a raised to the power of the totient of n is congruent to one, modulo n, or:

In mathematics, thenth cyclotomic polynomial, for any positive integer n, is the unique irreducible polynomial with integer coefficients that is a divisor of $and is not a divisor of for any k < n . Its roots are all n th primitive roots of unity, where k runs over the positive integers not greater than n and coprime to n . In other words, the n th cyclotomic polynomial is equal to$

A highly composite number, sometimes called an antiprime number, is a positive integer with more divisors than any smaller positive integer has. The term was coined by Ramanujan (1915). However, Jean-Pierre Kahane has suggested that the concept might have been known to Plato, who set 5040 as the ideal number of citizens in a city as 5040 has more divisors than any numbers less than it.

In number theory, a Wieferich prime is a prime number p such that p² divides $2 p - 1 - 1$ , therefore connecting these primes with Fermat's little theorem, which states that every odd prime p divides $2 p - 1 - 1$ . Wieferich primes were first described by Arthur Wieferich in 1909 in works pertaining to Fermat's last theorem, at which time both of Fermat's theorems were already well known to mathematicians.

In recreational number theory, a unique prime or unique period prime is a certain kind of prime number. A prime p ≠ 2, 5 is called unique if there is no other prime q such that the period length of the decimal expansion of its reciprocal, 1 / p, is equal to the period length of the reciprocal of q, 1 / q. For example, 3 is the only prime with period 1, 11 is the only prime with period 2, 37 is the only prime with period 3, 101 is the only prime with period 4, so they are unique primes. In contrast, 41 and 271 both have period 5; 7 and 13 both have period 6; 239 and 4649 both have period 7; 73 and 137 both have period 8; 21649 and 513239 both have period 11; 53, 79 and 265371653 all have period 13; 31 and 2906161 both have period 15; 17 and 5882353 both have period 16; 2071723 and 5363222357 both have period 17; 19 and 52579 both have period 18; 3541 and 27961 both have period 20. Therefore, none of these is a unique prime. Unique primes were first described by Samuel Yates in 1980.

In mathematics, a semiprime is a natural number that is the product of exactly two prime numbers. The two primes in the product may equal each other, so the semiprimes include the squares of prime numbers. Because there are infinitely many prime numbers, there are also infinitely many semiprimes. Semiprimes are also called biprimes.

In mathematics, and more particularly in number theory, primorial, denoted by “#”, is a function from natural numbers to natural numbers similar to the factorial function, but rather than successively multiplying positive integers, the function only multiplies prime numbers.

A highly totient number $is an integer that has more solutions to the equation, where is Euler's totient function, than any integer below it. The first few highly totient numbers are$

Carmichael function function of interest in number theory

In number theory, a branch of mathematics, the Carmichael function associates to every positive integer $n$ a positive integer $λ (n)$ , defined as the smallest positive integer $m$ such that

In modular arithmetic, the integers coprime to n from the set $of n non-negative integers form a group under multiplication modulo n, called the multiplicative group of integers modulo n . Equivalently, the elements of this group can be thought of as the congruence classes, also known as residues modulo n, that are coprime to n . Hence another name is the group of primitive residue classes modulo n . In the theory of rings, a branch of abstract algebra, it is described as the group of units of the ring of integers modulo n . Here units refers to elements with a multiplicative inverse, which in this ring are exactly those coprime to n .$

In mathematics, a prime power is a positive integer power of a single prime number. For example: 7 = 7¹, 9 = 3² and 64 = 2⁶ are prime powers, while 6 = 2 × 3, 12 = 2² × 3 and 36 = 6² = 2² × 3² are not. (The number 1 is not counted as a prime power.)

In mathematics, a sparsely totient number is a certain kind of natural number. A natural number, n, is sparsely totient if for all m > n,

A Giuga number is a composite number n such that for each of its distinct prime factors p_i we have $, or equivalently such that for each of its distinct prime factors p i we have .$

In number theory, the Dedekind psi function is the multiplicative function on the positive integers defined by

In number theory, a perfect totient number is an integer that is equal to the sum of its iterated totients. That is, we apply the totient function to a number n, apply it again to the resulting totient, and so on, until the number 1 is reached, and add together the resulting sequence of numbers; if the sum equals n, then n is a perfect totient number.

In mathematics, Lehmer's totient problem asks whether there is any composite number n such that Euler's totient function φ(n) divides n − 1. This is an unsolved problem.

References

Burris, S.; Lee, S. (1993). "Tarski's high school identities". Amer. Math. Monthly . 100 (3): 231–236 [p. 233]. doi:10.1080/00029890.1993.11990393. JSTOR 2324454.
Sloane, N.; Plouffe, S. (1995). The Encyclopedia of Integer Sequences. New York: Academic Press. ISBN 0-12-558630-2. M0660

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

v t e Prime number classes
By formula	Fermat ( $2 2 n + 1$ ) Mersenne ( $2 p - 1$ ) Double Mersenne ( $2 2 p -1 - 1$ ) Wagstaff $(2 p + 1)/3$ Proth ( $k \cdot2 n + 1$ ) Factorial ( $n! \pm 1$ ) Primorial ( $p n # \pm 1$ ) Euclid ( $p n # + 1$ ) Pythagorean ( $4 n + 1$ ) Pierpont ( $2 m \cdot3 n + 1$ ) Quartan ( $x 4 + y 4$ ) Solinas ( $2 m \pm 2 n \pm 1$ ) Cullen ( $n \cdot2 n + 1$ ) Woodall ( $n \cdot2 n - 1$ ) Cuban ( $x 3 - y 3)/(x - y$ ) Carol $(2 n - 1) 2 - 2$ Kynea $(2 n + 1) 2 - 2$ Leyland ( $x y + y x$ ) Thabit ( $3\cdot2 n - 1$ ) Williams ( $(b -1)\cdot b n - 1$ ) Mills ( $⌊ A 3 n ⌋$ )
By integer sequence	Fibonacci Lucas Pell Newman–Shanks–Williams Perrin Partitions Bell Motzkin
By property	Wieferich (pair) Wall–Sun–Sun Wolstenholme Wilson Lucky Fortunate Ramanujan Pillai Regular Strong Stern Supersingular (elliptic curve) Supersingular (moonshine theory) Good Super Higgs Highly cototient
Base-dependent	Palindromic Emirp Repunit $(10 n - 1)/9$ Permutable Circular Truncatable Minimal Weakly Primeval Full reptend Unique Happy Self Smarandache–Wellin Strobogrammatic Dihedral Tetradic
Patterns	Twin ( $p, p + 2$ ) Bi-twin chain ( $n - 1, n + 1, 2 n - 1, 2 n + 1, \dots$ ) Triplet ( $p, p + 2 or p + 4, p + 6$ ) Quadruplet ( $p, p + 2, p + 6, p + 8$ ) k−Tuple Cousin ( $p, p + 4$ ) Sexy ( $p, p + 6$ ) Chen Sophie Germain/Safe ( $p, 2 p + 1$ ) Cunningham ( $p, 2 p \pm 1, 4 p \pm 3, 8 p \pm 7, ...$ ) Arithmetic progression ( $p + a\cdotn, n = 0, 1, 2, 3, ...$ ) Balanced ( $consecutive p - n, p, p + n$ )
By size	Titanic (1,000+ digits) Gigantic (10,000+ digits) Mega (1,000,000+ digits) Largest known
Complex numbers	Eisenstein prime Gaussian prime
Composite numbers	Pseudoprime Catalan Elliptic Euler Euler–Jacobi Fermat Frobenius Lucas Somer–Lucas Strong Carmichael number Almost prime Semiprime Interprime Pernicious
Related topics	Probable prime Industrial-grade prime Illegal prime Formula for primes Prime gap
First 60 primes	2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281
List of prime numbers