Jump to content
Wikipedia The Free Encyclopedia

Sparsely totient number

From Wikipedia, the free encyclopedia
Number n where phi(m) is greater than phi(n) for all m greater than n
This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations . Please help improve this article by introducing more precise citations. (September 2025) (Learn how and when to remove this message)

In mathematics, specifically number theory, a sparsely totient number is a natural number, n, such that for all m > n,

φ ( m ) > φ ( n ) {\displaystyle \varphi (m)>\varphi (n)} {\displaystyle \varphi (m)>\varphi (n)}

where φ {\displaystyle \varphi } {\displaystyle \varphi } is Euler's totient function. The first few sparsely totient numbers are:

2, 6, 12, 18, 30, 42, 60, 66, 90, 120, 126, 150, 210, 240, 270, 330, 420, 462, 510, 630, 660, 690, 840, 870, 1050, 1260, 1320, 1470, 1680, 1890, 2310, 2730, 2940, 3150, 3570, 3990, 4620, 4830, 5460, 5610, 5670, 6090, 6930, 7140, 7350, 8190, 9240, 9660, 9870, ... (sequence A036913 in the OEIS).

The concept was introduced by David Masser and Peter Man-Kit Shiu in 1986. As they showed, every primorial is sparsely totient.

Properties

[edit ]
  • If P(n) is the largest prime factor of n, then lim inf P ( n ) / log n = 1 {\displaystyle \liminf P(n)/\log n=1} {\displaystyle \liminf P(n)/\log n=1}.
  • P ( n ) log δ n {\displaystyle P(n)\ll \log ^{\delta }n} {\displaystyle P(n)\ll \log ^{\delta }n} holds for an exponent δ = 37 / 20 {\displaystyle \delta =37/20} {\displaystyle \delta =37/20}.
  • It is conjectured that lim sup P ( n ) / log n = 2 {\displaystyle \limsup P(n)/\log n=2} {\displaystyle \limsup P(n)/\log n=2}.
  • They are always even because if x is odd, then 2x also has the same Totient function, trivially failing the condition that all numbers more than it has more value of Totient function than it.

References

[edit ]
Classes of natural numbers
×ばつ_2b_±_1276">Of the form a × 2b ± 1
Other polynomial numbers
Recursively defined numbers
Possessing a specific set of other numbers
Expressible via specific sums
2-dimensional
centered
non-centered
3-dimensional
centered
non-centered
pyramidal
4-dimensional
non-centered
Combinatorial numbers
Divisor functions
Prime omega functions
Euler's totient function
Aliquot sequences
Primorial
Numeral system-dependent numbers
Arithmetic functions
and dynamics
Digit sum
Digit product
Coding-related
Other
P-adic numbers-related
Digit-composition related
Digit-permutation related
Divisor-related
Other
Generated via a sieve
Sorting related
Graphemics related

AltStyle によって変換されたページ (->オリジナル) /