Live briefing
Everything about Euler's totient function
Number of integers coprime to and less than n
In number theory, Euler's totient function counts the positive integers up to a given integer that are relatively prime to. 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 in the range for which the greatest common divisor is equal to 1. The integers of this form are sometimes referred to as totatives of. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Euler's totient functionA 5-minute orientation
- Skim a recent paper: Analysis of fractional Euler-Bernoulli bending beams using Green’s function methodInfluential work since 2022
- Pick up a classic book: Euler's GemThe most-reprinted book on the subject
- Read the landmark paper: Euler and the Zeta FunctionCited 232 times
- Go sideways: Arithmetic functionA closely related topic
- Go sideways: Ramanujan's sumA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Euler and the Zeta Function
On a sum involving the Euler function
On a sum involving the Euler function
Degenerate Euler zeta function
The Euler binary partition function and subdivision schemes
On a sum involving the Euler totient function
Derivative polynomials of a function related to the Apostol-Euler and Frobenius-Euler numbers
On a generalization of the Euler totient function
🆕 Influential since 2022
Analysis of fractional Euler-Bernoulli bending beams using Green’s function method
Fractional Euler-Maclaurin-type inequalities for various function classes
Some New Approaches to Fractional Euler–Maclaurin-Type Inequalities via Various Function Classes
Euler Phi Function and Gamma Function Based Elliptic Curve Encryption for Secured Group Communication
A new Euler-Beta function model with statistical implementation related to the Mittag-Leffler-Kummer function
📚 Books worth reading
Euler's GemDavid S. Richeson · 2008
GammaJulian Havil · 2003- 📕Accurate monotonicity-preserving schemes with Runge-Kutta time steppingA. Suresh · 1997
- 📕Application of the space-time conservation element and solution element method to shock-tube problemXiao-Yen Wang · 1994
The Lerch zeta-functionAntanas Laurinčikas, A. Laurincikas · 2002- 📕The space-time conservation element and solution element method--a new high-resolution and genuinely multidimensional paradigm for solving conservation lawsXiao-Yen Wang · 1998
- 📕The generalized Euler-Mascheroni constantsO. R. Ainsworth · 1984
- 📕The method of space-time conservation element and solution element-applications to one-dimensional and two-dimensional time-marching flow problemsSin-Chung Chang · 1995
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Arithmetic function This article uses technical mathematical notation for logarithms. All instances of log(x) without a subscript base should be interpreted as a natural…
- Ramanujan's sum In number theory, Ramanujan's sum, usually denoted cq(n), is a function of two positive integer variables q and n defined by the formula cq(n)=∑1≤a≤q(a…
- Euler's theorem In number theory, Euler's theorem (also known as the Fermat–Euler theorem or Euler's totient theorem) states that, if n and a are coprime positive integers…
- Carmichael function In number theory, a branch of mathematics, the Carmichael function λ(n) of a positive integer n is the smallest positive integer m such that am≡1(modn)…
- Divisor function In mathematics, and specifically in number theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to…
- Cyclotomic polynomial In mathematics, the n-th cyclotomic polynomial, for any positive integer n, is the unique irreducible polynomial with integer coefficients that is a divisor…
- Möbius function The Möbius function μ(n) is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated…
- Average order of an arithmetic function In number theory, an average order of an arithmetic function is some simpler or better-understood function which takes the same values "on average". Let…