|
Robin's Inequality
In mathematics, and specifically in number theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as ''the'' divisor function, it counts the ''number of divisors of an integer'' (including 1 and the number itself). It appears in a number of remarkable identities, including relationships on the Riemann zeta function and the Eisenstein series of modular forms. Divisor functions were studied by Ramanujan, who gave a number of important congruences and identities; these are treated separately in the article Ramanujan's sum. A related function is the divisor summatory function, which, as the name implies, is a sum over the divisor function. Definition The sum of positive divisors function σ''z''(''n''), for a real or complex number ''z'', is defined as the sum of the ''z''th powers of the positive divisors of ''n''. It can be expressed in sigma notation as :\sigma_z(n)=\sum_ d^z\,\! , where is shorthand for "''d'' divi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Divisor
In mathematics, a divisor of an integer n, also called a factor of n, is an integer m that may be multiplied by some integer to produce n. In this case, one also says that n is a multiple of m. An integer n is divisible or evenly divisible by another integer m if m is a divisor of n; this implies dividing n by m leaves no remainder. Definition An integer is divisible by a nonzero integer if there exists an integer such that n=km. This is written as :m\mid n. Other ways of saying the same thing are that divides , is a divisor of , is a factor of , and is a multiple of . If does not divide , then the notation is m\not\mid n. Usually, is required to be nonzero, but is allowed to be zero. With this convention, m \mid 0 for every nonzero integer . Some definitions omit the requirement that m be nonzero. General Divisors can be negative as well as positive, although sometimes the term is restricted to positive divisors. For example, there are six divisors of 4; they ar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Summation
In mathematics, summation is the addition of a sequence of any kind of numbers, called ''addends'' or ''summands''; the result is their ''sum'' or ''total''. Beside numbers, other types of values can be summed as well: functions, vectors, matrices, polynomials and, in general, elements of any type of mathematical objects on which an operation denoted "+" is defined. Summations of infinite sequences are called series. They involve the concept of limit, and are not considered in this article. The summation of an explicit sequence is denoted as a succession of additions. For example, summation of is denoted , and results in 9, that is, . Because addition is associative and commutative, there is no need of parentheses, and the result is the same irrespective of the order of the summands. Summation of a sequence of only one element results in this element itself. Summation of an empty sequence (a sequence with no elements), by convention, results in 0. Very often, the elements ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Completely Multiplicative Function
In number theory, functions of positive integers which respect products are important and are called completely multiplicative functions or totally multiplicative functions. A weaker condition is also important, respecting only products of coprime numbers, and such functions are called multiplicative functions. Outside of number theory, the term "multiplicative function" is often taken to be synonymous with "completely multiplicative function" as defined in this article. Definition A completely multiplicative function (or totally multiplicative function) is an arithmetic function (that is, a function whose domain is the natural numbers), such that ''f''(1) = 1 and ''f''(''ab'') = ''f''(''a'')''f''(''b'') holds ''for all'' positive integers ''a'' and ''b''. Without the requirement that ''f''(1) = 1, one could still have ''f''(1) = 0, but then ''f''(''a'') = 0 for all positive integers ''a'', so this is not a very strong restriction. The definition above can be rephrased using the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Multiplicative Function
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 f(ab) = f(a)f(b) 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. Examples Some multiplicative functions are defined to make formulas easier to write: * 1(''n''): the constant function, defined by 1(''n'') = 1 (completely multiplicative) * Id(''n''): identity function, defined by Id(''n'') = ''n'' (completely multiplicative) * Id''k''(''n''): the power functions, defined by Id''k''(''n'') = ''n''''k'' for any complex number ''k'' (completely multiplicative). As special cases we have ** Id0(''n'') = 1(''n'') and ** Id1(''n'') = Id(''n''). * ''ε''(''n''): the function defined by ''ε''(''n'') ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fermi–Dirac Prime
In number theory, a Fermi–Dirac prime is a prime power whose exponent is a power of two. These numbers are named from an analogy to Fermi–Dirac statistics in physics based on the fact that each integer has a unique representation as a product of Fermi–Dirac primes without repetition. Each element of the sequence of Fermi–Dirac primes is the smallest number that does not divide the product of all previous elements. Srinivasa Ramanujan used the Fermi–Dirac primes to find the smallest number whose number of divisors is a given power of two. Definition The Fermi–Dirac primes are a sequence of numbers obtained by raising a prime number to an exponent that is a power of two. That is, these are the numbers of the form p^ where p is a prime number and k is a non-negative integer. These numbers form the sequence: They can be obtained from the prime numbers by repeated squaring, and form the smallest set of numbers that includes all of the prime numbers and is closed under s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Power Of Two
A power of two is a number of the form where is an integer, that is, the result of exponentiation with number two as the base and integer as the exponent. In a context where only integers are considered, is restricted to non-negative values, so there are 1, 2, and 2 multiplied by itself a certain number of times. The first ten powers of 2 for non-negative values of are: : 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, ... Because two is the base of the binary numeral system, powers of two are common in computer science. Written in binary, a power of two always has the form 100...000 or 0.00...001, just like a power of 10 in the decimal system. Computer science Two to the exponent of , written as , is the number of ways the bits in a binary word of length can be arranged. A word, interpreted as an unsigned integer, can represent values from 0 () to () inclusively. Corresponding signed integer values can be positive, negative and zero; see signed n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Primorial
In mathematics, and more particularly in number theory, primorial, denoted by "#", is a function from natural numbers to natural numbers similar to the factorial function, but rather than successively multiplying positive integers, the function only multiplies prime numbers. The name "primorial", coined by Harvey Dubner, draws an analogy to ''primes'' similar to the way the name "factorial" relates to ''factors''. Definition for prime numbers For the th prime number , the primorial is defined as the product of the first primes: :p_n\# = \prod_^n p_k, where is the th prime number. For instance, signifies the product of the first 5 primes: :p_5\# = 2 \times 3 \times 5 \times 7 \times 11 = 2310. The first five primorials are: : 2, 6, 30, 210, 2310 . The sequence also includes as empty product. Asymptotically, primorials grow according to: :p_n\# = e^, where is Little O notation. Definition for natural numbers In general, for a positive integer , its pri ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Number
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, or , involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow method of checking the primality of a given number n, called trial division, tests whether n is a multiple of any integer between 2 and \sqrt. Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which always pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Abundancy Index
In number theory, an abundant number or excessive number is a number for which the sum of its proper divisors is greater than the number. The integer 12 is the first abundant number. Its proper divisors are 1, 2, 3, 4 and 6 for a total of 16. The amount by which the sum exceeds the number is the abundance. The number 12 has an abundance of 4, for example. Definition A number ''n'' for which the ''sum'' ''of'' ''divisors'' ''σ''(''n'') > 2''n'', or, equivalently, the sum of proper divisors (or aliquot sum) ''s''(''n'') > ''n''. Abundance is the value ''σ''(''n'') − ''2n'' (or ''s''(''n'') − ''n''). Examples The first 28 abundant numbers are: :12, 18, 20, 24, 30, 36, 40, 42, 48, 54, 56, 60, 66, 70, 72, 78, 80, 84, 88, 90, 96, 100, 102, 104, 108, 112, 114, 120, ... . For example, the proper divisors of 24 are 1, 2, 3, 4, 6, 8, and 12, whose sum is 36. Because 36 is greater than 24, the number 24 is abundant. Its abundance is 36 − 24 = 12. Prope ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aliquot Sequence
In mathematics, an aliquot sequence is a sequence of positive integers in which each term is the sum of the proper divisors of the previous term. If the sequence reaches the number 1, it ends, since the sum of the proper divisors of 1 is 0. Definition and overview The aliquot sequence starting with a positive integer ''k'' can be defined formally in terms of the sum-of-divisors function σ1 or the aliquot sum function ''s'' in the following way: : ''s''0 = ''k'' : ''s''n = ''s''(''s''''n''−1) = σ1(''s''''n''−1) − ''s''''n''−1 if ''s''''n''−1 > 0 : ''s''n = 0 if ''s''''n''−1 = 0 ---> (if we add this condition, then the terms after 0 are all 0, and all aliquot sequences would be infinite sequence, and we can conjecture that all aliquot sequences are convergent, the limit of these sequences are usually 0 or 6) and ''s''(0) is undefined. For example, the aliquot sequence of 10 is 10, 8, 7, 1, 0 because: :σ1(10) − 10 = 5 + 2 + 1 = 8, : ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Proper Divisor
In mathematics, a divisor of an integer n, also called a factor of n, is an integer m that may be multiplied by some integer to produce n. In this case, one also says that n is a multiple of m. An integer n is divisible or evenly divisible by another integer m if m is a divisor of n; this implies dividing n by m leaves no remainder. Definition An integer is divisible by a nonzero integer if there exists an integer such that n=km. This is written as :m\mid n. Other ways of saying the same thing are that divides , is a divisor of , is a factor of , and is a multiple of . If does not divide , then the notation is m\not\mid n. Usually, is required to be nonzero, but is allowed to be zero. With this convention, m \mid 0 for every nonzero integer . Some definitions omit the requirement that m be nonzero. General Divisors can be negative as well as positive, although sometimes the term is restricted to positive divisors. For example, there are six divisors of 4; they are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aliquot Sum
In number theory, the aliquot sum ''s''(''n'') of a positive integer ''n'' is the sum of all proper divisors of ''n'', that is, all divisors of ''n'' other than ''n'' itself. That is, :s(n)=\sum\nolimits_d. It can be used to characterize the prime numbers, perfect numbers, "sociable numbers", deficient numbers, abundant numbers, and untouchable numbers, and to define the aliquot sequence of a number. Examples For example, the proper divisors of 12 (that is, the positive divisors of 12 that are not equal to 12) are 1, 2, 3, 4, and 6, so the aliquot sum of 12 is 16 i.e. (1 + 2 + 3 + 4 + 6). The values of ''s''(''n'') for ''n'' = 1, 2, 3, ... are: :0, 1, 1, 3, 1, 6, 1, 7, 4, 8, 1, 16, 1, 10, 9, 15, 1, 21, 1, 22, 11, 14, 1, 36, 6, 16, 13, 28, 1, 42, 1, 31, 15, 20, 13, 55, 1, 22, 17, 50, 1, 54, 1, 40, 33, 26, 1, 76, 8, 43, ... Characterization of classes of numbers The aliquot sum function can be used to characterize several notable classes of numbers: *1 is the only number whose ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
