|
Divergence Of The Sum Of The Reciprocals Of The Primes
The sum of the reciprocals of all prime numbers diverges; that is: \sum_\frac1p = \frac12 + \frac13 + \frac15 + \frac17 + \frac1 + \frac1 + \frac1 + \cdots = \infty This was proved by Leonhard Euler in 1737, and strengthens Euclid's 3rd-century-BC result that there are infinitely many prime numbers and Nicole Oresme's 14th-century proof of the divergence of the sum of the reciprocals of the integers (harmonic series). There are a variety of proofs of Euler's result, including a lower bound for the partial sums stating that \sum_\frac1p \ge \log \log (n+1) - \log\frac6 for all natural numbers . The double natural logarithm () indicates that the divergence might be very slow, which is indeed the case. See Meissel–Mertens constant. The harmonic series First, we will describe how Euler originally discovered the result. He was considering the harmonic series \sum_^\infty \frac = 1 + \frac + \frac + \frac + \cdots = \infty He had already used the following " product formu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sum Of Reciprocals Of Primes
Sum most commonly means the total of two or more numbers added together; see addition. Sum can also refer to: Mathematics * Sum (category theory), the generic concept of summation in mathematics * Sum, the result of summation, the addition of a sequence of numbers * 3SUM, a term from computational complexity theory * Band sum, a way of connecting mathematical knots * Connected sum, a way of gluing manifolds * Digit sum, in number theory * Direct sum, a combination of algebraic objects ** Direct sum of groups ** Direct sum of modules ** Direct sum of permutations ** Direct sum of topological groups * Einstein summation, a way of contracting tensor indices * Empty sum, a sum with no terms * Indefinite sum, the inverse of a finite difference * Kronecker sum, an operation considered a kind of addition for matrices * Matrix addition, in linear algebra * Minkowski addition, a sum of two subsets of a vector space * Power sum symmetric polynomial, in commutative algebra * Prefix su ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Introductio In Analysin Infinitorum
''Introductio in analysin infinitorum'' (Latin: ''Introduction to the Analysis of the Infinite'') is a two-volume work by Leonhard Euler which lays the foundations of mathematical analysis. Written in Latin and published in 1748, the ''Introductio'' contains 18 chapters in the first part and 22 chapters in the second. It has Eneström index, Eneström numbers E101 and E102. It is considered the first precalculus book. Contents Chapter 1 is on the concepts of variable (mathematics), variables and function (mathematics), functions. Chapters 2 and 3 are concerned with the transformation of functions. Chapter 4 introduces infinite series through rational functions. According to Henk Bos (historian), Henk Bos, :The ''Introduction'' is meant as a survey of concepts and methods in analysis and analytic geometry preliminary to the study of the differential and integral calculus. [Euler] made of this survey a masterly exercise in introducing as much as possible of analysis without using di ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euler
Leonhard Euler ( ; ; ; 15 April 170718 September 1783) was a Swiss polymath who was active as a mathematician, physicist, astronomer, logician, geographer, and engineer. He founded the studies of graph theory and topology and made influential discoveries in many other branches of mathematics, such as analytic number theory, complex analysis, and infinitesimal calculus. He also introduced much of modern mathematical terminology and notation, including the notion of a mathematical function. He is known for his work in mechanics, fluid dynamics, optics, astronomy, and music theory. Euler has been called a "universal genius" who "was fully equipped with almost unlimited powers of imagination, intellectual gifts and extraordinary memory". He spent most of his adult life in Saint Petersburg, Russia, and in Berlin, then the capital of Prussia. Euler is credited for popularizing the Greek letter \pi (lowercase pi) to denote the ratio of a circle's circumference to its diameter, as we ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Set Difference
In set theory, the complement of a set , often denoted by A^c (or ), is the set of elements not in . When all elements in the universe, i.e. all elements under consideration, are considered to be members of a given set , the absolute complement of is the set of elements in that are not in . The relative complement of with respect to a set , also termed the set difference of and , written B \setminus A, is the set of elements in that are not in . Absolute complement Definition If is a set, then the absolute complement of (or simply the complement of ) is the set of elements not in (within a larger set that is implicitly defined). In other words, let be a set that contains all the elements under study; if there is no need to mention , either because it has been previously specified, or it is obvious and unique, then the absolute complement of is the relative complement of in : A^c= U \setminus A = \. The absolute complement of is usually denoted by A^c. Other ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fundamental Theorem Of Arithmetic
In mathematics, the fundamental theorem of arithmetic, also called the unique factorization theorem and prime factorization theorem, states that every integer greater than 1 is prime or can be represented uniquely as a product of prime numbers, up to the order of the factors. For example, : 1200 = 2^4 \cdot 3^1 \cdot 5^2 = (2 \cdot 2 \cdot 2 \cdot 2) \cdot 3 \cdot (5 \cdot 5) = 5 \cdot 2 \cdot 5 \cdot 2 \cdot 3 \cdot 2 \cdot 2 = \ldots The theorem says two things about this example: first, that 1200 be represented as a product of primes, and second, that no matter how this is done, there will always be exactly four 2s, one 3, two 5s, and no other primes in the product. The requirement that the factors be prime is necessary: factorizations containing composite numbers may not be unique (for example, 12 = 2 \cdot 6 = 3 \cdot 4). This theorem is one of the main reasons why 1 is not considered a prime number: if 1 were prime, then factorization into primes would not be unique; ... [...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] |
Cardinality
The thumb is the first digit of the hand, next to the index finger. When a person is standing in the medical anatomical position (where the palm is facing to the front), the thumb is the outermost digit. The Medical Latin English noun for thumb is ''pollex'' (compare ''hallux'' for big toe), and the corresponding adjective for thumb is ''pollical''. Definition Thumb and fingers The English word ''finger'' has two senses, even in the context of appendages of a single typical human hand: 1) Any of the five terminal members of the hand. 2) Any of the four terminal members of the hand, other than the thumb. Linguistically, it appears that the original sense was the first of these two: (also rendered as ) was, in the inferred Proto-Indo-European language, a suffixed form of (or ), which has given rise to many Indo-European-family words (tens of them defined in English dictionaries) that involve, or stem from, concepts of fiveness. The thumb shares the following with each of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Divisible
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 n is divisible by a nonzero integer m if there exists an integer k such that n=km. This is written as : m\mid n. This may be read as that m divides n, m is a divisor of n, m is a factor of n, or n is a multiple of m. If m does not divide n, then the notation is m\not\mid n. There are two conventions, distinguished by whether m is permitted to be zero: * With the convention without an additional constraint on m, m \mid 0 for every integer m. * With the convention that m be nonzero, m \mid 0 for every nonzero integer m. General Divisors can be negative as well as positive, although often the term is restricted to posi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Integer
An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative integers. The set (mathematics), set of all integers is often denoted by the boldface or blackboard bold The set of natural numbers \mathbb is a subset of \mathbb, which in turn is a subset of the set of all rational numbers \mathbb, itself a subset of the real numbers \mathbb. Like the set of natural numbers, the set of integers \mathbb is Countable set, countably infinite. An integer may be regarded as a real number that can be written without a fraction, fractional component. For example, 21, 4, 0, and −2048 are integers, while 9.75, , 5/4, and Square root of 2, are not. The integers form the smallest Group (mathematics), group and the smallest ring (mathematics), ring containing the natural numbers. In algebraic number theory, the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Positive Number
In mathematics, the sign of a real number is its property of being either positive, negative, or 0. Depending on local conventions, zero may be considered as having its own unique sign, having no sign, or having both positive and negative sign. In some contexts, it makes sense to distinguish between a positive and a negative zero. In mathematics and physics, the phrase "change of sign" is associated with exchanging an object for its additive inverse (multiplication with −1, negation), an operation which is not restricted to real numbers. It applies among other objects to vectors, matrices, and complex numbers, which are not prescribed to be only either positive, negative, or zero. The word "sign" is also often used to indicate binary aspects of mathematical or scientific objects, such as odd and even ( sign of a permutation), sense of orientation or rotation ( cw/ccw), one sided limits, and other concepts described in below. Sign of a number Numbers from various number ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convergent Series
In mathematics, a series is the sum of the terms of an infinite sequence of numbers. More precisely, an infinite sequence (a_1, a_2, a_3, \ldots) defines a series that is denoted :S=a_1 + a_2 + a_3 + \cdots=\sum_^\infty a_k. The th partial sum is the sum of the first terms of the sequence; that is, :S_n = a_1 +a_2 + \cdots + a_n = \sum_^n a_k. A series is convergent (or converges) if and only if the sequence (S_1, S_2, S_3, \dots) of its partial sums tends to a limit; that means that, when adding one a_k after the other ''in the order given by the indices'', one gets partial sums that become closer and closer to a given number. More precisely, a series converges, if and only if there exists a number \ell such that for every arbitrarily small positive number \varepsilon, there is a (sufficiently large) integer N such that for all n \ge N, :\left , S_n - \ell \right , 1 produce a convergent series: *: ++++++\cdots = . * Alternating the signs of reciprocals of powers o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Series (mathematics)
In mathematics, a series is, roughly speaking, an addition of Infinity, infinitely many Addition#Terms, terms, one after the other. The study of series is a major part of calculus and its generalization, mathematical analysis. Series are used in most areas of mathematics, even for studying finite structures in combinatorics through generating functions. The mathematical properties of infinite series make them widely applicable in other quantitative disciplines such as physics, computer science, statistics and finance. Among the Ancient Greece, Ancient Greeks, the idea that a potential infinity, potentially infinite summation could produce a finite result was considered paradoxical, most famously in Zeno's paradoxes. Nonetheless, infinite series were applied practically by Ancient Greek mathematicians including Archimedes, for instance in the Quadrature of the Parabola, quadrature of the parabola. The mathematical side of Zeno's paradoxes was resolved using the concept of a limit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
