Search references for COMPLETELY MULTIPLICATIVE-FUNCTION. Phrases containing COMPLETELY MULTIPLICATIVE-FUNCTION
See searches and references containing COMPLETELY MULTIPLICATIVE-FUNCTION!COMPLETELY MULTIPLICATIVE-FUNCTION
Arithmetic function
theory, functions of positive integers which respect products are important and are called completely multiplicative functions or totally multiplicative functions
Completely multiplicative function
Completely_multiplicative_function
Function equal to the product of its values on coprime factors
{\displaystyle b} are coprime. An arithmetic function is said to be completely multiplicative (or totally multiplicative) if f ( 1 ) = 1 {\displaystyle f(1)=1}
Multiplicative_function
Function that returns its argument unchanged
is a completely multiplicative function (essentially multiplication by 1), considered in number theory. In a metric space the identity function is trivially
Identity_function
Function on an integer n which is log(p) if n equals p^k and zero otherwise
an important arithmetic function that is neither multiplicative nor additive. The von Mangoldt function, denoted by Λ ( n ) {\displaystyle \Lambda (n)}
Von_Mangoldt_function
Function whose domain is the positive integers
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
Arithmetic_function
Function that can be written as a sum over prime factors
multiplicative functions. Every completely additive function is additive, but not vice versa. Examples of arithmetic functions which are completely additive
Additive_function
Mathematical operation on arithmetical functions
Dirichlet convolution of two multiplicative functions is again multiplicative, and every not constantly zero multiplicative function has a Dirichlet inverse
Dirichlet_convolution
Idk is the completely multiplicative function Id k ( n ) = n k {\displaystyle \operatorname {Id} _{k}(n)=n^{k}} . The divisor function σ k {\displaystyle
Bell_series
Identity obeyed by many special functions related to the gamma function
polygamma function is the logarithmic derivative of the gamma function, and thus, the multiplication theorem becomes additive, instead of multiplicative: k m
Multiplication_theorem
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 ≠
Unit_function
Function in number theory
{a}{p}}\right)=\left({\frac {b}{p}}\right).} The Legendre symbol is a completely multiplicative function of its top argument: ( a b p ) = ( a p ) ( b p ) . {\displaystyle
Legendre_symbol
Complex-valued arithmetic function
\chi (ab)=\chi (a)\chi (b);} that is, χ {\displaystyle \chi } is completely multiplicative. 2. χ ( a ) = 0 ⟺ gcd ( a , m ) > 1 {\displaystyle \chi (a)=0\iff
Dirichlet_character
Mathematical series
{f(n)\log(n)}{n^{s}}}} assuming the right hand side converges. For a completely multiplicative function f(n), and assuming the series converges for Re(s) > σ0, then
Dirichlet_series
Performing order of mathematical operations
is replaced with multiplication by the reciprocal (multiplicative inverse), then the associative and commutative laws of multiplication allow the factors
Order_of_operations
Association of one output to each input
compute the zeros of the function, the values where the function is defined but not its multiplicative inverse. Similarly, a function of a complex variable
Function_(mathematics)
Generalization of the Legendre symbol in number theory
the top or bottom argument is fixed, the Jacobi symbol is a completely multiplicative function in the remaining argument: 4. ( a b n ) = ( a n ) ( b n )
Jacobi_symbol
Product of the first "n" prime numbers
where φ {\displaystyle \varphi } is the Euler totient function. Any completely multiplicative function is defined by its values at primorials, since it is
Primorial
Product of the prime factors of an integer
(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
Radical_of_an_integer
Algebraic structure with addition, multiplication, and division
+ (−a) = 0. Multiplicative inverses: for every a ≠ 0 in F, there exists an element in F, denoted by a−1 or 1/a, called the multiplicative inverse of a
Field_(mathematics)
Arithmetic function
(a)+\Omega (b)} , then λ ( n ) {\displaystyle \lambda (n)} is completely multiplicative. Since 1 {\displaystyle 1} has no prime factors, Ω ( 1 ) = 0 {\displaystyle
Liouville_function
Algorithm for fast modular multiplication
Montgomery modular multiplication, more commonly referred to as Montgomery multiplication, is a method for performing fast modular multiplication. It was introduced
Montgomery modular multiplication
Montgomery_modular_multiplication
Mathematical concept
misunderstood, (f(x))−1 certainly denotes the multiplicative inverse of f(x) and has nothing to do with the inverse function of f. The notation f ⟨ − 1 ⟩ {\displaystyle
Inverse_function
Mathematical description of quantum state
every possible square integrable function. The state of such a particle is completely described by its wave function, Ψ ( x , t ) , {\displaystyle \Psi
Wave_function
Type of mathematical function
Since a Dirichlet character χ {\displaystyle \chi } is completely multiplicative, its L-function can also be written as an Euler product in the half-plane
Dirichlet_L-function
Root of a quadratic polynomial with a unit leading coefficient
(this is false if D > 0 {\textstyle D>0} ). The norm is a completely multiplicative function, which means that the norm of a product of quadratic integers
Quadratic_integer
Arithmetic function related to the divisors of an integer
{\displaystyle n>1} , x > 0 {\displaystyle x>0} . The divisor function is multiplicative (since each divisor c of the product mn with gcd ( m , n ) = 1
Divisor_function
Norm on a vector space of matrices
} can be rescaled to be sub-multiplicative; in some books, the terminology matrix norm is reserved for sub-multiplicative norms. A matrix norm is called
Matrix_norm
Family of solutions to related differential equations
Bessel functions are a class of special functions that commonly appear in problems involving wave motion, heat conduction, and other physical phenomena
Bessel_function
Generalized function whose value is zero everywhere except at zero
Dirac delta function (or δ {\displaystyle {\boldsymbol {\delta }}} distribution), also known as the unit impulse, is a generalized function on the real
Dirac_delta_function
Function computed by two parties that emulates a random oracle
An oblivious pseudorandom function (OPRF) is a cryptographic function, similar to a keyed-hash function, but with the distinction that in an OPRF two
Oblivious pseudorandom function
Oblivious_pseudorandom_function
Calculator designed to calculate problems in science, engineering, and mathematics
subtraction, multiplication, division) and advanced (trigonometric, hyperbolic, etc.) mathematical operations and functions. They have completely replaced
Scientific_calculator
Algebraic structure in linear algebra
w, and called the sum of these two vectors. The binary function, called scalar multiplication, assigns to any scalar a in F and any vector v in V another
Vector_space
Mathematical relation making a non-equal comparison
additive inverse, and the multiplicative inverse for positive numbers, are both examples of applying a monotonically decreasing function. If the inequality is
Inequality_(mathematics)
Formal power series
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
Generating_function
Type of continuous linear operator
) d y , {\displaystyle (Kf)(x)=\int _{a}^{b}k(x,y)f(y)\,dy,} where the function k {\displaystyle k} is called the integral kernel. Under suitable regularity
Compact_operator
Objects that generalize functions
Distributions (or generalized functions) are objects that generalize the classical notion of functions in mathematical analysis. Distributions make it
Distribution (mathematical analysis)
Distribution_(mathematical_analysis)
Generalization of the real numbers
fraction, the power function x ∈ N o {\textstyle x\in \mathbb {No} } , x ↦ xy may be composed from multiplication, multiplicative inverse and square root
Surreal_number
Output of a dynamic system when given a brief input
transform of a system's output may be determined by the multiplication of the transfer function with the input's Laplace transform in the complex plane
Impulse_response
Algorithm for public-key cryptography
The possibility of using Euler totient function results also from Lagrange's theorem applied to the multiplicative group of integers modulo pq. Thus any
RSA_cryptosystem
Inverse functions of sin, cos, tan, etc.
than function composition, and therefore may result in confusion between notation for the reciprocal (multiplicative inverse) and inverse function. The
Inverse trigonometric functions
Inverse_trigonometric_functions
Repeated sum of a number's digits
_{b}(a)\cdot \operatorname {dr} _{b}(c)).} This is a consequence of multiplicative compatibility modulo b − 1 {\displaystyle b-1} . Compatibility with
Digital_root
Generalization of additive and multiplicative inverses
-1}} is not commonly used for function composition, since 1 f {\textstyle {\frac {1}{f}}} can be used for the multiplicative inverse. If x and y are invertible
Inverse_element
Branch of mathematics
is invertible only if its determinant has a multiplicative inverse in the ring. Vector spaces are completely characterized by their dimension (up to an
Linear_algebra
Unsolved problem in mathematics
the tau function is not completely multiplicative, the sums cannot be written using geometric series like in the case of the Riemann zeta function or Dirichlet
Ramanujan–Petersson conjecture
Ramanujan–Petersson_conjecture
Theorem in geometry
equivalent to the multiplicative version. To prove the equivalence one direction (from Brunn–Minkowski inequality to its multiplicative form), apply the
Brunn–Minkowski_theorem
Set with operations obeying given axioms
which the multiplication operation is commutative. Field: a commutative division ring (i.e. a commutative ring which contains a multiplicative inverse for
Algebraic_structure
Arithmetic operation
nonzero numbers have a multiplicative inverse. In these cases, a division by x may be computed as the product by the multiplicative inverse of x. This approach
Division_(mathematics)
Meromorphic function
Bernstein's theorem on monotone functions that, for m > 0 and x real and non-negative, (−1)m+1 ψ(m)(x) is a completely monotone function. Setting m = 0 in the above
Polygamma_function
Algorithm to multiply matrices
subtraction operations. Applying this recursively gives an algorithm with a multiplicative cost of O ( n log 2 7 ) ≈ O ( n 2.807 ) {\displaystyle O(n^{\log _{2}7})\approx
Matrix multiplication algorithm
Matrix_multiplication_algorithm
Authenticated encryption mode for block ciphers
constructed by feeding blocks of data into the GHASH function and encrypting the result. This GHASH function is defined by GHASH ( H , A , C ) = X m + n +
Galois/Counter_Mode
Certain type of divisor of an integer
unitary divisors of n are multiplicative functions of n that are not completely multiplicative. The Dirichlet generating function is ζ ( s ) ζ ( s − k )
Unitary_divisor
Mathematical function
In mathematics, the digamma function is defined as the logarithmic derivative of the gamma function: ψ ( z ) = d d z ln Γ ( z ) = Γ ′ ( z ) Γ ( z )
Digamma_function
Theory that attempts to blend economics and ergodic theory
non-ergodicity in economic processes is a repeated multiplicative coin toss, an instance of the binomial multiplicative process. It demonstrates how an expected-value
Ergodicity_economics
Hypercomplex number system
{\displaystyle {e_{i}}^{2}=-1\ } for each point in the diagram completely defines the multiplicative structure of the octonions. Each of the seven lines generates
Octonion
Mathematical representation in functional analysis
of continuous functions on the spectrum σ(x) into A such that It maps 1 to the multiplicative identity of A; It maps the identity function on the spectrum
Gelfand_representation
Mathematical function of two variables; outputs 1 if they are equal, 0 otherwise
the result of directly sampling the Dirac delta function. The Kronecker delta forms the multiplicative identity element of an incidence algebra. The Kronecker
Kronecker_delta
Mathematical conjecture about zeros of L-functions
\rightarrow \mathbb {C} } of modulus q is an arithmetic function that is: completely multiplicative: χ ( a ⋅ b ) = χ ( a ) ⋅ χ ( b ) {\textstyle \chi (a\cdot
Generalized Riemann hypothesis
Generalized_Riemann_hypothesis
Square of numbers with equal row, column and diagonal totals
some other operation. For example, a multiplicative magic square has a constant product of numbers. A multiplicative magic square can be derived from an
Magic_square
Vector space equipped with a bilinear product
algebras over a field, the bilinear multiplication from A × A to A is completely determined by the multiplication of basis elements of A. Conversely,
Algebra_over_a_field
Axioms for the natural numbers
{\displaystyle S(0)} is also the multiplicative left identity requires the induction axiom due to the way multiplication is defined: S ( 0 ) {\displaystyle
Peano_axioms
Finnish mathematician
distribution of multiplicative functions over short intervals of numbers; for instance, she showed that the values of the Möbius function are evenly divided
Kaisa_Matomäki
Alteration in the nucleotide sequence of a genome
effect, alter the product of a gene, or prevent the gene from functioning properly or completely. Mutations can also occur in non-genic regions. A 2007 study
Mutation
Set of quantities in probability theory
1112/plms/s2-30.1.199. hdl:2440/15200. Speicher, Roland (1994). "Multiplicative functions on the lattice of non-crossing partitions and free convolution"
Cumulant
for f any arithmetic function and g completely multiplicative where φ ( n ) {\displaystyle \varphi (n)} is Euler's totient function and μ ( n ) {\displaystyle
Divisor_sum_identities
Number of prime factors of a natural number
main subsection of this article above. To be completely precise, let the odd-indexed summatory function be defined as S odd ( x ) := ∑ n ≤ x ω ( n ) [
Prime_omega_function
Algorithm for generating pseudo-randomized numbers
that specify the generator. If c = 0, the generator is often called a multiplicative congruential generator (MCG), or Lehmer RNG. If c ≠ 0, the method is
Linear_congruential_generator
In mathematics, invariant of square matrices
composed of n rows, the determinant is an n-linear function. The determinant is a multiplicative map, i.e., for square matrices A {\displaystyle A} and
Determinant
Operations on ordinals that extend classical arithmetic
standard multiplication. α · 0 = 0 · α = 0, and the zero-product property holds: α · β = 0 implies α = 0 or β = 0. The ordinal 1 is a multiplicative identity
Ordinal_arithmetic
Algebraic curve in mathematics
ingredient is a function of a complex variable, L, the Hasse–Weil zeta function of E over Q. This function is a variant of the Riemann zeta function and Dirichlet
Elliptic_curve
Counts the number of necklaces of n colored beads picked from α available colors
n\,N_{n}\,=\,n*(n\,M_{n})} , since the function f ( n ) = n {\displaystyle f(n)=n} is completely multiplicative. Any two of these imply the third, for
Necklace_polynomial
Potential counterexample to the generalized Riemann hypothesis
arithmetic function χ : Z → C {\textstyle \chi \colon \mathbb {Z} \to \mathbb {C} } satisfying the following properties: Completely multiplicative: χ ( m
Siegel_zero
2017 research paper by Google
was the use of multiplicative gating units, in which the outputs of some neurons modulate the outputs of others. These multiplicative units are conceptually
Attention_Is_All_You_Need
Output as a function of input frequency
the quantitative measure of the magnitude and phase of the output as a function of input frequency. The frequency response is widely used in the design
Frequency_response
Category of regression analysis
to Nonparametric regression. HyperNiche, software for nonparametric multiplicative regression. Scale-adaptive nonparametric regression (with Matlab software)
Nonparametric_regression
Variations in data at specific regular intervals less than a year
component. The multiplicative model can be transformed into an additive model by taking the log of the time series; SA Multiplicative decomposition: Y
Seasonality
important question in mathematics is whether a space can be completely described by the functions defined on it—that is, by its "observables." The Banach–Stone
Banach–Stone_theorem
Method for bounding the errors of numerical computations
arithmetic fail to hold in complex interval arithmetic: the additive and multiplicative properties, of ordinary complex conjugates, do not hold for complex
Interval_arithmetic
Integration kernels for smoothing out sharp features
kernel is one of the functions nowadays called mollifiers. However, since the properties of a linear integral operator are completely determined by its kernel
Mollifier
Generalization of vector spaces from fields to rings
vector spaces such as Lp spaces.) Suppose that R is a ring, and 1 is its multiplicative identity. A left R-module M consists of an abelian group (M, +) and
Module_(mathematics)
matrix elements are dense in the space of continuous functions, which determine the group completely. Gelfand–Naimark theorem Representation theory И. М
Gelfand–Raikov_theorem
Ideal in a ring which has properties similar to prime elements
manifold, R is the ring of smooth real functions on M, and x is a point in M, then the set of all smooth functions f with f (x) = 0 forms a prime ideal
Prime_ideal
Open problem on 3x+1 and x/2 functions
odd, triple it and add one. In modular arithmetic notation, define the function f as follows: f ( n ) = { n / 2 if n ≡ 0 ( mod 2 ) , 3 n + 1 if n ≡ 1
Collatz_conjecture
Function spaces generalizing finite-dimensional p norm spaces
function" (or norm), that is: only the zero vector has zero length, the length of the vector is positive homogeneous with respect to multiplication by
Lp_space
Field extension generated by a one element
generates L × = L − { 0 } {\displaystyle L^{\times }=L-\{0\}} as a multiplicative group, so that every nonzero element of L is a power of γ, i.e. is produced
Simple_extension
CPU instruction to simultaneously read and write a value in memory
write a new value into it simultaneously, either with a completely new value or some function of the previous value. These operations prevent race conditions
Read–modify–write
Recursive integer sequence
can be completely parenthesized, i.e. the number of ways of associating n applications of a binary operator (as in the matrix chain multiplication problem)
Catalan_number
Quantum algorithm for integer factorization
{\displaystyle a} is contained in the multiplicative group of integers modulo N {\displaystyle N} , having a multiplicative inverse modulo N {\displaystyle
Shor's_algorithm
Correlation of a signal with a time-shifted copy of itself, as a function of shift
t {\displaystyle t} . Subtracting the mean before multiplication yields the auto-covariance function between times t 1 {\displaystyle t_{1}} and t 2 {\displaystyle
Autocorrelation
Number
0/x = 0, for nonzero x. But x/0 is undefined, because 0 has no multiplicative inverse (no real number multiplied by 0 produces 1), a consequence of
0
Extension of evidence theory to continuous variables of interest
Except for normalization constant, the above equation completely determines the normal density function for X. Therefore, M ( X → ) {\displaystyle M({\vec
Linear_belief_function
Integer filtered out using a sieve similar to that of Eratosthenes
original list (1, 2, 3...). When this procedure has been carried out completely, the remaining integers are the lucky numbers (those that happen to be
Lucky_number
Bounded operators with sub-unit norm
form φ ⋅ H∞ where g is an inner function, i.e. such that |φ| = 1 on S1: φ is uniquely determined up to multiplication by a complex number of modulus 1
Contraction_(operator_theory)
Problem about mathematical number fields
complex multiplication, now often known as the Kronecker Jugendtraum, does this for the case of any imaginary quadratic field, by using modular functions and
Hilbert's_twelfth_problem
Paradox involving a game with repeated coin flipping
utility. General dynamics beyond the purely multiplicative case can correspond to non-logarithmic utility functions, as was pointed out by Carr and Cherubini
St._Petersburg_paradox
complexity of matrix multiplication. 4. Written as a function of another function, it is used for comparing the asymptotic growth of two functions. See Big O notation
Glossary of mathematical symbols
Glossary_of_mathematical_symbols
Fully simplified fraction
by requiring the denominator to be positive. In the case of rational functions the denominator could similarly be required to be a monic polynomial.
Irreducible_fraction
Computation model defining an abstract machine
\rightharpoonup Q\times \Gamma \times \{L,R\}} is a partial function called the transition function, where L is left shift, R is right shift. If δ {\displaystyle
Turing_machine
Average value of a random variable
the underlying probability measure. Non-multiplicativity: In general, the expected value is not multiplicative, i.e. E [ X Y ] {\displaystyle \operatorname
Expected_value
Polynomial whose roots are the eigenvalues of a matrix
The term secular function has been used for what is now called characteristic polynomial (in some literature the term secular function is still used).
Characteristic_polynomial
Mathematical approximation of a function
of a function is an infinite sum of terms that are expressed in terms of the function's derivatives at a single point. For most common functions, the
Taylor_series
COMPLETELY MULTIPLICATIVE-FUNCTION
COMPLETELY MULTIPLICATIVE-FUNCTION
Boy/Male
Indian, Sanskrit
Completely White; Silver
Boy/Male
Indian, Sanskrit
To Conquer Completely
Boy/Male
Tamil
Complete
Boy/Male
Indian, Punjabi, Sikh
Completely Immortal
Boy/Male
Sikh
Completely colorful and musical
Girl/Female
German, Greek
All; Completely; Light
Girl/Female
Finnish, French, German
Bright; All; Completely
Girl/Female
Tamil
Complete
Girl/Female
Tamil
Completed
Boy/Male
Indian, Punjabi, Sikh
Completely Wise
Girl/Female
Tamil
Sampriya | ஸமà¯à®ªà¯à®°à¯€à®¯à®¾
Completely pleased, Satisfied
Sampriya | ஸமà¯à®ªà¯à®°à¯€à®¯à®¾
Girl/Female
German
All; Completely
Girl/Female
Tamil
Complete
Boy/Male
Indian, Punjabi, Sikh
Completely Devoted to God
Girl/Female
Hindu
Completely pleased, Satisfied
Boy/Male
Tamil
Poornan | பூரà¯à®¨à®¾à®¨
Complete
Poornan | பூரà¯à®¨à®¾à®¨
Boy/Male
Tamil
Complete
Boy/Male
Hindu, Indian, Sanskrit, Telugu
Completely Victorious
Girl/Female
Hindu, Indian
Completed
Girl/Female
Tamil
Complete
COMPLETELY MULTIPLICATIVE-FUNCTION
COMPLETELY MULTIPLICATIVE-FUNCTION
Boy/Male
Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Telugu
Bright; Wisely; Smart; Shape
Girl/Female
Hindu
Affectionate, Smooth, Tender
Male
Native American
Native American Hopi name ISTAQA means "coyote man."
Girl/Female
Sikh
Praiseworthy master
Boy/Male
Tamil
Living for ever
Girl/Female
Gujarati, Hindu, Indian, Marathi, Sanskrit, Tamil
Sun of Art; A Portion of the Sun
Boy/Male
Hindu, Indian, Sanskrit, Traditional
Wealth Giving Lord; Another Name for Kubera
Girl/Female
Australian, Bengali, Gujarati, Hindu, Indian
Light of the Lamp; Light
Girl/Female
Finnish
Boy/Male
Gujarati, Hindu, Indian
Lord Ram
COMPLETELY MULTIPLICATIVE-FUNCTION
COMPLETELY MULTIPLICATIVE-FUNCTION
COMPLETELY MULTIPLICATIVE-FUNCTION
COMPLETELY MULTIPLICATIVE-FUNCTION
COMPLETELY MULTIPLICATIVE-FUNCTION
n.
The art of increasing gold or silver by magic, -- attributed formerly to the alchemists.
v. t.
To sail completely round.
v. t.
To bring to a state in which there is no deficiency; to perfect; to consummate; to accomplish; to fulfill; to finish; as, to complete a task, or a poem; to complete a course of education.
a.
Finished; ended; concluded; completed; as, the edifice is complete.
n.
The result of any process inverse to multiplication. See the Note under Multiplication.
adv.
So as to multiply.
adv.
Completely; vigorously; in earnest.
n.
A quality, endowment, or acquirement completely excellent; an ideal faultlessness; especially, the divine attribute of complete excellence.
adv.
In a whole or complete manner; entirely; completely; perfectly.
adv.
Completely; beyond recovery.
a.
Completely armed; panoplied.
imp. & p. p.
of Complete
n.
The process of repeating, or adding to itself, any given number or quantity a certain number of times; commonly, the process of ascertaining by a briefer computation the result of such repeated additions; also, the rule by which the operation is performed; -- the reverse of division.
a.
Tending to multiply; having the power to multiply, or incease numbers.
n.
The act or process of multiplying, or of increasing in number; the state of being multiplied; as, the multiplication of the human species by natural generation.
n.
An increase above the normal number of parts, especially of petals; augmentation.
adv.
In a complete manner; fully.
adv.
Completely; utterly.
n.
Formation into, or multiplication of, vacuoles.
adv.
Without exception; wholly; completely.