|
Bi-unitary Divisor
In mathematics, a natural number ''a'' is a unitary divisor (or Hall divisor) of a number ''b'' if ''a'' is a divisor of ''b'' and if ''a'' and \frac are coprime, having no common factor other than 1. Thus, 5 is a unitary divisor of 60, because 5 and \frac=12 have only 1 as a common factor, while 6 is a divisor but not a unitary divisor of 60, as 6 and \frac=10 have a common factor other than 1, namely 2. 1 is a unitary divisor of every natural number. Equivalently, a divisor ''a'' of ''b'' is a unitary divisor if and only if every prime factor of ''a'' has the same multiplicity in ''a'' as it has in ''b''. The sum-of-unitary-divisors function is denoted by the lowercase Greek letter sigma thus: σ*(''n''). The sum of the ''k''-th powers of the unitary divisors is denoted by σ*''k''(''n''): :\sigma_k^*(n) = \sum_ \!\! d^k. If the proper unitary divisors of a given number add up to that number, then that number is called a unitary perfect number. Properties The number of unitar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Power Of 2
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 num ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematische Zeitschrift .
''Mathematische Zeitschrift'' (German for ''Mathematical Journal'') is a mathematical journal for pure and applied mathematics published by Springer Verlag. It was founded in 1918 and edited by Leon Lichtenstein together with Konrad Knopp, Erhard Schmidt, and Issai Schur. Past editors include Erich Kamke, Friedrich Karl Schmidt, Rolf Nevanlinna, Helmut Wielandt, and Olivier Debarre Olivier Debarre (born 1959) is a French mathematician who specializes in complex algebraic geometry.Debarr ... External links * * Mathematics journals Publications established in 1918 {{math ...[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Springer-Verlag
Springer Science+Business Media, commonly known as Springer, is a German multinational publishing company of books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing. Originally founded in 1842 in Berlin, it expanded internationally in the 1960s, and through mergers in the 1990s and a sale to venture capitalists it fused with Wolters Kluwer and eventually became part of Springer Nature in 2015. Springer has major offices in Berlin, Heidelberg, Dordrecht, and New York City. History Julius Springer founded Springer-Verlag in Berlin in 1842 and his son Ferdinand Springer grew it from a small firm of 4 employees into Germany's then second largest academic publisher with 65 staff in 1872.Chronology ". Springer Science+Business Media. In 1964, Springer expanded its business internationally, o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
OEIS
The On-Line Encyclopedia of Integer Sequences (OEIS) is an online database of integer sequences. It was created and maintained by Neil Sloane while researching at AT&T Labs. He transferred the intellectual property and hosting of the OEIS to the OEIS Foundation in 2009. Sloane is chairman of the OEIS Foundation. OEIS records information on integer sequences of interest to both professional and amateur mathematicians, and is widely cited. , it contains over 350,000 sequences, making it the largest database of its kind. Each entry contains the leading terms of the sequence, keywords, mathematical motivations, literature links, and more, including the option to generate a graph or play a musical representation of the sequence. The database is searchable by keyword, by subsequence, or by any of 16 fields. History Neil Sloane started collecting integer sequences as a graduate student in 1965 to support his work in combinatorics. The database was at first stored on punched cards. H ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 f be an arithmetic function. We say that an ''average order'' of f is g if \sum_ f(n) \sim \sum_ g(n) as x tends to infinity. It is conventional to choose an approximating function g that is continuous and monotone. But even so an average order is of course not unique. In cases where the limit \lim_ \frac\sum_ f(n)=c exists, it is said that f has a mean value (average value) c. Examples * An average order of , the number of divisors of , is ; * An average order of , the sum of divisors of , is ; * An average order of , Euler's totient function of , is ; * An average order of , the number of ways of expressing as a sum of two squares, is ; * The average order of representations of a natural number as a sum of three squares is ; * The average number of decompositions of a natural number into a sum of one or more consecutive pri ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square-free Integer
In mathematics, a square-free integer (or squarefree integer) is an integer which is divisible by no square number other than 1. That is, its prime factorization has exactly one factor for each prime that appears in it. For example, is square-free, but is not, because 18 is divisible by . The smallest positive square-free numbers are Square-free factorization Every positive integer n can be factored in a unique way as n=\prod_^k q_i^i, where the q_i different from one are square-free integers that are pairwise coprime. This is called the ''square-free factorization'' of . To construct the square-free factorization, let n=\prod_^h p_j^ be the prime factorization of n, where the p_j are distinct prime numbers. Then the factors of the square-free factorization are defined as q_i=\prod_p_j. An integer is square-free if and only if q_i=1 for all i > 1. An integer greater than one is the kth power of another integer if and only if k is a divisor of all i such that q_i\neq 1. T ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dirichlet Generating Function
In mathematics, a generating function is a way of encoding an infinite sequence of numbers () by treating them as the coefficients of a formal power series. This series is called the generating function of the sequence. Unlike an ordinary series, the ''formal'' power series is not required to converge: in fact, the generating function is not actually regarded as a function, and the "variable" remains an indeterminate. Generating functions were first introduced by Abraham de Moivre in 1730, in order to solve the general linear recurrence problem. One can generalize to formal power series in more than one indeterminate, to encode information about infinite multi-dimensional arrays of numbers. There are various types of generating functions, including ordinary generating functions, exponential generating functions, Lambert series, Bell series, and Dirichlet series; definitions and examples are given below. Every sequence in principle has a generating function of each type (except t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Completely Multiplicative
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] |
Parity (mathematics)
In mathematics, parity is the property of an integer of whether it is even or odd. An integer is even if it is a multiple of two, and odd if it is not.. For example, −4, 0, 82 are even because \begin -2 \cdot 2 &= -4 \\ 0 \cdot 2 &= 0 \\ 41 \cdot 2 &= 82 \end By contrast, −3, 5, 7, 21 are odd numbers. The above definition of parity applies only to integer numbers, hence it cannot be applied to numbers like 1/2 or 4.201. See the section "Higher mathematics" below for some extensions of the notion of parity to a larger class of "numbers" or in other more general settings. Even and odd numbers have opposite parities, e.g., 22 (even number) and 13 (odd number) have opposite parities. In particular, the parity of zero is even. Any two consecutive integers have opposite parity. A number (i.e., integer) expressed in the decimal numeral system is even or odd according to whether its last digit is even or odd. That is, if the last digit is 1, 3, 5, 7, or 9, then it is odd; otherwis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Natural Number
In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and ordering (as in "this is the ''third'' largest city in the country"). Numbers used for counting are called ''Cardinal number, cardinal numbers'', and numbers used for ordering are called ''Ordinal number, ordinal numbers''. Natural numbers are sometimes used as labels, known as ''nominal numbers'', having none of the properties of numbers in a mathematical sense (e.g. sports Number (sports), jersey numbers). Some definitions, including the standard ISO/IEC 80000, ISO 80000-2, begin the natural numbers with , corresponding to the non-negative integers , whereas others start with , corresponding to the positive integers Texts that exclude zero from the natural numbers sometimes refer to the natural numbers together with zero as the whole numbers, while in other writings, that term is used instead for the integers (including negative integers). The natural ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
