TOPICS
Search

Search Results for ""


11 - 20 of 3402 for Eulers Totient FunctionSearch Results
A generalization of the Euler L-function associated with a Grössencharakter.
There are two definitions of the Carmichael function. One is the reduced totient function (also called the least universal exponent function), defined as the smallest integer ...
A positive value of n for which x-phi(x)=n has no solution, where phi(x) is the totient function. The first few are 10, 26, 34, 50, 52, ... (OEIS A005278).
A positive even value of n for which phi(x)=n, where phi(x) is the totient function, has no solution. The first few are 14, 26, 34, 38, 50, ... (OEIS A005277).
The number of bases in which 1/p is a repeating decimal (actually, repeating b-ary) of length l is the same as the number of fractions 0/(p-1), 1/(p-1), ..., (p-2)/(p-1) ...
Ein(z) = int_0^z((1-e^(-t))dt)/t (1) = E_1(z)+lnz+gamma, (2) where gamma is the Euler-Mascheroni constant and E_1 is the En-function with n=1.
The conjecture that all integers >1 occur as a value of the totient valence function (i.e., all integers >1 occur as multiplicities). The conjecture was proved by Ford ...
An Artin L-function over the rationals Q encodes in a generating function information about how an irreducible monic polynomial over Z factors when reduced modulo each prime. ...
A totative is a positive integer less than or equal to a number n which is also relatively prime to n, where 1 is counted as being relatively prime to all numbers. The number ...
For a discrete function f(n), the summatory function is defined by F(n)=sum_(k in D)^nf(k), where D is the domain of the function.
1|2|3|4|5 ... 341 Previous Next

...