|
Von Staudt–Clausen Theorem
In number theory, the von Staudt–Clausen theorem is a result determining the fractional part of Bernoulli numbers, found independently by and . Specifically, if is a positive integer and we add to the Bernoulli number for every prime such that divides , then we obtain an integer; that is, B_ + \sum_ \frac1p \in \Z . This fact immediately allows us to characterize the denominators of the non-zero Bernoulli numbers as the product of all primes such that divides ; consequently, the denominators are square-free and divisible by 6. These denominators are : 6, 30, 42, 30, 66, 2730, 6, 510, 798, 330, 138, 2730, 6, 870, 14322, 510, 6, 1919190, 6, 13530, ... . The sequence of integers B_ + \sum_ \frac1p is : 1, 1, 1, 1, 1, 1, 2, -6, 56, -528, 6193, -86579, 1425518, -27298230, ... . Proof A proof of the Von Staudt–Clausen theorem follows from an explicit formula for Bernoulli numbers which is: : B_=\sum_^\sum_^ and as a corollary: : B_=\sum_^(-1)^jS(2n,j) where are t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Number Theory
Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers (for example, rational numbers), or defined as generalizations of the integers (for example, algebraic integers). Integers can be considered either in themselves or as solutions to equations (Diophantine geometry). Questions in number theory can often be understood through the study of Complex analysis, analytical objects, such as the Riemann zeta function, that encode properties of the integers, primes or other number-theoretic objects in some fashion (analytic number theory). One may also study real numbers in relation to rational numbers, as for instance how irrational numbers can be approximated by fractions (Diophantine approximation). Number theory is one of the oldest branches of mathematics alongside geometry. One quirk of number theory is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fractional Part
The fractional part or decimal part of a non‐negative real number x is the excess beyond that number's integer part. The latter is defined as the largest integer not greater than , called ''floor'' of or \lfloor x\rfloor. Then, the fractional part can be formulated as a difference: :\operatorname (x)=x - \lfloor x \rfloor,\; x > 0. The fractional part of logarithms, specifically, is also known as the mantissa; by contrast with the mantissa, the integral part of a logarithm is called its ''characteristic''. The word ''mantissa'' was introduced by Henry Briggs. For a positive number written in a conventional positional numeral system (such as binary or decimal), its fractional part hence corresponds to the digits appearing after the radix point, such as the decimal point in English. The result is a real number in the half-open interval x, -\lfloor , x, \rfloor , or by the [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bernoulli Number
In mathematics, the Bernoulli numbers are a sequence of rational numbers which occur frequently in analysis. The Bernoulli numbers appear in (and can be defined by) the Taylor series expansions of the tangent and hyperbolic tangent functions, in Faulhaber's formula for the sum of ''m''-th powers of the first ''n'' positive integers, in the Euler–Maclaurin formula, and in expressions for certain values of the Riemann zeta function. The values of the first 20 Bernoulli numbers are given in the adjacent table. Two conventions are used in the literature, denoted here by B^_n and B^_n; they differ only for , where B^_1=-1/2 and B^_1=+1/2. For every odd , . For every even , is negative if is divisible by 4 and positive otherwise. The Bernoulli numbers are special values of the Bernoulli polynomials B_n(x), with B^_n=B_n(0) and B^+_n=B_n(1). The Bernoulli numbers were discovered around the same time by the Swiss mathematician Jacob Bernoulli, after whom they are named, an ... [...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 (mathematics), 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 factorization, 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 primality test, method of checking the primality of a given number , called trial division, tests whether is a multiple of any integer between 2 and . Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error ... [...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. Th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stirling Numbers Of The Second Kind
In mathematics, particularly in combinatorics, a Stirling number of the second kind (or Stirling partition number) is the number of ways to partition a set of ''n'' objects into ''k'' non-empty subsets and is denoted by S(n,k) or \textstyle \left\. Stirling numbers of the second kind occur in the field of mathematics called combinatorics and the study of partitions. They are named after James Stirling. The Stirling numbers of the first and second kind can be understood as inverses of one another when viewed as triangular matrices. This article is devoted to specifics of Stirling numbers of the second kind. Identities linking the two kinds appear in the article on Stirling numbers. Definition The Stirling numbers of the second kind, written S(n,k) or \lbrace\textstyle\rbrace or with other notations, count the number of ways to partition a set of n labelled objects into k nonempty unlabelled subsets. Equivalently, they count the number of different equivalence relations wit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fermat's Little Theorem
In number theory, Fermat's little theorem states that if is a prime number, then for any integer , the number is an integer multiple of . In the notation of modular arithmetic, this is expressed as a^p \equiv a \pmod p. For example, if and , then , and is an integer multiple of . If is not divisible by , that is, if is coprime to , then Fermat's little theorem is equivalent to the statement that is an integer multiple of , or in symbols: a^ \equiv 1 \pmod p. For example, if and , then , and is a multiple of . Fermat's little theorem is the basis for the Fermat primality test and is one of the fundamental results of elementary number theory. The theorem is named after Pierre de Fermat, who stated it in 1640. It is called the "little theorem" to distinguish it from Fermat's Last Theorem.. History Pierre de Fermat first stated the theorem in a letter dated October 18, 1640, to his friend and confidant Frénicle de Bessy. His formulation is equivalent to the following ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kummer's Congruence
In mathematics, Kummer's congruences are some congruences involving Bernoulli numbers, found by . used Kummer's congruences to define the p-adic zeta function. Statement The simplest form of Kummer's congruence states that : \frac\equiv \frac \pmod p \text h\equiv k \pmod where ''p'' is a prime, ''h'' and ''k'' are positive even integers not divisible by ''p''−1 and the numbers ''B''''h'' are Bernoulli numbers. More generally if ''h'' and ''k'' are positive even integers not divisible by ''p'' − 1, then : (1-p^)\frac\equiv (1-p^)\frac \pmod whenever : h\equiv k\pmod where φ(''p''''a''+1) is the Euler totient function, evaluated at ''p''''a''+1 and ''a'' is a non negative integer. At ''a'' = 0, the expression takes the simpler form, as seen above. The two sides of the Kummer congruence are essentially values of the p-adic zeta function, and the Kummer congruences imply that the ''p''-adic zeta function for negative integers is continuous, so can be extended b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Astronomische Nachrichten
''Astronomische Nachrichten'' (''Astronomical Notes''), one of the first international journals in the field of astronomy, was established in 1821 by the German astronomer Heinrich Christian Schumacher. It claims to be the oldest astronomical journal in the world that is still being published. The publication today specializes in articles on solar physics, extragalactic astronomy, cosmology, geophysics, and instrumentation for these fields. All articles are subject to peer review. Early history The journal was founded in 1821 by Heinrich Christian Schumacher,''Publications of the Astronomical Society of the Pacific'', page 60, v.7 (1895) under the patronage of Christian VIII of Denmark, and quickly became the world's leading professional publication for the field of astronomy. Schumacher edited the journal at the Altona Observatory, then under the administration of Denmark, later part of Prussia, and today part of the German city of Hamburg. Schumacher edited the first 31 issu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
