Global Information Lookup Global Information

Multiplicative function information


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.

An arithmetic function f(n) is said to be completely multiplicative (or totally multiplicative) if f(1) = 1 and f(ab) = f(a)f(b) holds for all positive integers a and b, even when they are not coprime.

and 26 Related for: Multiplicative function information

Request time (Page generated in 0.8641 seconds.)

Multiplicative function

Last Update:

a and b are coprime. An arithmetic function f(n) is said to be completely multiplicative (or totally multiplicative) if f(1) = 1 and f(ab) = f(a)f(b) holds...

Word Count : 2979

Completely multiplicative function

Last Update:

convolution of two multiplicative functions is multiplicative, the Dirichlet convolution of two completely multiplicative functions need not be completely...

Word Count : 874

Multiplicative inverse

Last Update:

mathematics, a multiplicative inverse or reciprocal for a number x, denoted by 1/x or x−1, is a number which when multiplied by x yields the multiplicative identity...

Word Count : 2354

Multiplication theorem

Last Update:

polygamma function is the logarithmic derivative of the gamma function, and thus, the multiplication theorem becomes additive, instead of multiplicative: k m...

Word Count : 1969

Multiplicative

Last Update:

Multiplicative may refer to: Multiplication Multiplicative function Multiplicative group Multiplicative identity Multiplicative inverse Multiplicative...

Word Count : 61

Dirichlet convolution

Last Update:

Dirichlet convolution of two multiplicative functions is again multiplicative, and every not constantly zero multiplicative function has a Dirichlet inverse...

Word Count : 2527

Arithmetic function

Last Update:

f is multiplicative, then so is g. If f is completely multiplicative, then g is multiplicative, but may or may not be completely multiplicative. There...

Word Count : 7508

Ramanujan tau function

Last Update:

τ(n): τ(mn) = τ(m)τ(n) if gcd(m,n) = 1 (meaning that τ(n) is a multiplicative function) τ(pr + 1) = τ(p)τ(pr) − p11 τ(pr − 1) for p prime and r > 0. |τ(p)|...

Word Count : 1697

Identity function

Last Update:

the space. The identity function on the positive integers is a completely multiplicative function (essentially multiplication by 1), considered in number...

Word Count : 616

Additive function

Last Update:

analogy with totally multiplicative functions. If f is a completely additive function then f(1) = 0. Every completely additive function is additive, but not...

Word Count : 1239

Divisor

Last Update:

total number of positive divisors of n {\displaystyle n} is a multiplicative function d ( n ) , {\displaystyle d(n),} meaning that when two numbers m...

Word Count : 1797

Hash function

Last Update:

translates into a single integer multiplication and right-shift making it one of the fastest hash functions to compute. Multiplicative hashing is susceptible to...

Word Count : 7844

Von Mangoldt function

Last Update:

an important arithmetic function that is neither multiplicative nor additive. The von Mangoldt function, denoted by Λ(n), is defined as Λ ( n ) = { log...

Word Count : 1839

Greatest common divisor

Last Update:

be used to denote the GCD of multiple arguments. The GCD is a multiplicative function in the following sense: if a1 and a2 are relatively prime, then...

Word Count : 4674

Multiplicative order

Last Update:

\ 1{\pmod {n}}} . In other words, the multiplicative order of a modulo n is the order of a in the multiplicative group of the units in the ring of the...

Word Count : 624

Order of approximation

Last Update:

} The accuracy of the result justifies an attempt to derive a multiplicative function for that average, for example, y ∼ x + 2.67. {\displaystyle y\sim...

Word Count : 1501

Unit function

Last Update:

In number theory, the unit function is a completely multiplicative function on the positive integers defined as: ε ( n ) = { 1 , if  n = 1 0 , if  n ≠...

Word Count : 135

Radical of an integer

Last Update:

(504)=2\cdot 3\cdot 7=42} The function r a d {\displaystyle \mathrm {rad} } is multiplicative (but not completely multiplicative). The radical of any integer...

Word Count : 552

Generating function

Last Update:

generating function is especially useful when an is a multiplicative function, in which case it has an Euler product expression in terms of the function's Bell...

Word Count : 14536

Multiplication

Last Update:

generalizations See Multiplication in group theory, above, and multiplicative group, which for example includes matrix multiplication. A very general, and...

Word Count : 6254

Modular multiplicative inverse

Last Update:

solution, i.e., when it exists, a modular multiplicative inverse is unique: If b and b' are both modular multiplicative inverses of a respect to the modulus...

Word Count : 3639

Analytic number theory

Last Update:

about the Dirichlet series. Thus a common method for estimating a multiplicative function is to express it as a Dirichlet series (or a product of simpler...

Word Count : 3816

Liouville function

Last Update:

(n)=(-1)^{\Omega (n)}.} (sequence A008836 in the OEIS). λ is completely multiplicative since Ω(n) is completely additive, i.e.: Ω(ab) = Ω(a) + Ω(b). Since...

Word Count : 1841

1

Last Update:

called unity. Consequently, if f ( x ) {\displaystyle f(x)} is a multiplicative function, then f ( 1 ) {\displaystyle f(1)} must be equal to 1. This distinctive...

Word Count : 3548

Moebius

Last Update:

Möbius function, an important multiplicative function in number theory and combinatorics Möbius transform, transform involving the Möbius function Möbius...

Word Count : 676

Legendre symbol

Last Update:

In number theory, the Legendre symbol is a multiplicative function with values 1, −1, 0 that is a quadratic character modulo of an odd prime number p:...

Word Count : 2394

PDF Search Engine © AllGlobal.net