|
Selberg Sieve
In number theory, the Selberg sieve is a technique for estimating the size of "sifted sets" of positive integers which satisfy a set of conditions which are expressed by congruences. It was developed by Atle Selberg in the 1940s. Description In terms of sieve theory the Selberg sieve is of ''combinatorial type'': that is, derives from a careful use of the inclusion–exclusion principle. Selberg replaced the values of the Möbius function which arise in this by a system of weights which are then optimised to fit the given problem. The result gives an ''upper bound'' for the size of the sifted set. Let A be a set of positive integers \le x and let P be a set of primes. Let A_d denote the set of elements of A divisible by d when d is a product of distinct primes from P. Further let A_1 denote A itself. Let z be a positive real number and P(z) denote the product of the primes in P which are \le z. The object of the sieve is to estimate :S(A,P,z) = \left\vert A \setminus \big ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Atle Selberg
Atle Selberg (14 June 1917 – 6 August 2007) was a Norwegian mathematician known for his work in analytic number theory and the theory of automorphic forms, and in particular for bringing them into relation with spectral theory. He was awarded the Fields Medal in 1950 and an honorary Abel Prize in 2002. Early years Selberg was born in Langesund, Norway, the son of teacher Anna Kristina Selberg and mathematician Ole Michael Ludvigsen Selberg. Two of his three brothers, Sigmund Selberg, Sigmund and Henrik Selberg, Henrik, were also mathematicians. His other brother, Arne Selberg, Arne, was a professor of engineering. While he was still at school he was influenced by the work of Srinivasa Ramanujan and he found an exact analytical formula for the Partition function (number theory), partition function as suggested by the works of Ramanujan; however, this result was first published by Hans Rademacher. He studied at the University of Oslo and completed his PhD, doctorate in 1943 ... [...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] |
Positive Integer
In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive integers Some authors acknowledge both definitions whenever convenient. Sometimes, the whole numbers are the natural numbers as well as zero. In other cases, the ''whole numbers'' refer to all of the integers, including negative integers. The counting numbers are another term for the natural numbers, particularly in primary education, and are ambiguous as well although typically start at 1. The natural numbers are used for counting things, like "there are ''six'' coins on the table", in which case they are called ''cardinal numbers''. They are also used to put things in order, like "this is the ''third'' largest city in the country", which are called ''ordinal numbers''. Natural numbers are also used as labels, like jersey numbers on a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Congruence Relation
In abstract algebra, a congruence relation (or simply congruence) is an equivalence relation on an algebraic structure (such as a group (mathematics), group, ring (mathematics), ring, or vector space) that is compatible with the structure in the sense that algebraic operations done with equivalent elements will yield equivalent elements. Every congruence relation has a corresponding Equivalence class, quotient structure, whose elements are the equivalence classes (or congruence classes) for the relation. Definition The definition of a congruence depends on the type of algebraic structure under consideration. Particular definitions of congruence can be made for group (mathematics), groups, ring (mathematics), rings, vector spaces, module (mathematics), modules, semigroups, lattice (order), lattices, and so forth. The common theme is that a congruence is an equivalence relation on an algebraic object that is compatible with the algebraic structure, in the sense that the operat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sieve Theory
Sieve theory is a set of general techniques in number theory, designed to count, or more realistically to estimate the size of, sifted sets of integers. The prototypical example of a sifted set is the set of prime numbers up to some prescribed limit ''X''. Correspondingly, the prototypical example of a sieve is the sieve of Eratosthenes, or the more general Legendre sieve. The direct attack on prime numbers using these methods soon reaches apparently insuperable obstacles, in the way of the accumulation of error terms. In one of the major strands of number theory in the twentieth century, ways were found of avoiding some of the difficulties of a frontal attack with a naive idea of what sieving should be. One successful approach is to approximate a specific sifted set of numbers (e.g. the set of prime numbers) by another, simpler set (e.g. the set of almost prime numbers), which is typically somewhat larger than the original set, and easier to analyze. More sophisticated sieves a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inclusion–exclusion Principle
In combinatorics, the inclusion–exclusion principle is a counting technique which generalizes the familiar method of obtaining the number of elements in the union (set theory), union of two finite sets; symbolically expressed as : , A \cup B, = , A, + , B, - , A \cap B, where ''A'' and ''B'' are two finite sets and , ''S'', indicates the cardinality of a set ''S'' (which may be considered as the number of elements of the set, if the set is Finite set, finite). The formula expresses the fact that the sum of the sizes of the two sets may be too large since some elements may be counted twice. The double-counted elements are those in the intersection (set theory), intersection of the two sets and the count is corrected by subtracting the size of the intersection. The inclusion-exclusion principle, being a generalization of the two-set case, is perhaps more clearly seen in the case of three sets, which for the sets ''A'', ''B'' and ''C'' is given by :, A \cup B \cup C, = , A, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Möbius Function
The Möbius function \mu(n) is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated ''Moebius'') in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted \mu(x). Definition The Möbius function is defined by :\mu(n) = \begin 1 & \text n = 1 \\ (-1)^k & \text n \text k \text \\ 0 & \text n \text > 1 \end The Möbius function can alternatively be represented as : \mu(n) = \delta_ \lambda(n), where \delta_ is the Kronecker delta, \lambda(n) is the Liouville function, Prime omega function, \omega(n) is the number of distinct prime divisors of n, and Prime omega function, \Omega(n) is the number of prime factors of n, counted with multiplicity. Another characterization ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Multiplicative Function
In number theory, a multiplicative function is an arithmetic function f 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 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 * \operatorname(n): the identity function, defined by \operatorname(n)=n * \operatorname_k(n): the power functions, defined by \operatorname_k(n)=n^k for any complex number k. As special cases we have ** \operatorname_0(n)=1(n), and ** \operatorname_1(n)=\operatorname(n). * \varepsilon(n): the function defined by \varepsilon(n)=1 if n=1 and 0 otherwise; this is the unit function, so called because it is the multiplicative identity for Dirichlet convolution. Sometimes ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Möbius Inversion Formula
In mathematics, the classic Möbius inversion formula is a relation between pairs of arithmetic functions, each defined from the other by sums over divisors. It was introduced into number theory in 1832 by August Ferdinand Möbius. A large generalization of this formula applies to summation over an arbitrary locally finite partially ordered set, with Möbius' classical formula applying to the set of the natural numbers ordered by divisibility: see incidence algebra. Statement of the formula The classic version states that if and are arithmetic functions satisfying : g(n)=\sum_f(d)\quad\textn\ge 1 then :f(n)=\sum_\mu(d)\,g\!\left(\frac\right)\quad\textn\ge 1 where is the Möbius function and the sums extend over all positive divisors of (indicated by d \mid n in the above formulae). In effect, the original can be determined given by using the inversion formula. The two sequences are said to be Möbius transforms of each other. The formula is also correct if and are f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Least Common Multiple
In arithmetic and number theory, the least common multiple (LCM), lowest common multiple, or smallest common multiple (SCM) of two integers ''a'' and ''b'', usually denoted by , is the smallest positive integer that is divisible by both ''a'' and ''b''. Since division of integers by zero is undefined, this definition has meaning only if ''a'' and ''b'' are both different from zero. However, some authors define lcm(''a'', 0) as 0 for all ''a'', since 0 is the only common multiple of ''a'' and 0. The least common multiple of the denominators of two fractions is the "lowest common denominator" (lcd), and can be used for adding, subtracting or comparing the fractions. The least common multiple of more than two integers ''a'', ''b'', ''c'', . . . , usually denoted by , is defined as the smallest positive integer that is divisible by each of ''a'', ''b'', ''c'', . . . Overview A multiple of a number is the product of that number and an integer. For example, 10 is a multiple of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Brun–Titchmarsh Theorem
In analytic number theory, the Brun–Titchmarsh theorem, named after Viggo Brun and Edward Charles Titchmarsh, is an upper bound on the distribution of prime numbers in arithmetic progression. Statement Let \pi(x;q,a) count the number of primes ''p'' congruent to ''a'' modulo ''q'' with ''p'' ≤ ''x''. Then :\pi(x;q,a) \le for all ''q'' < ''x''. History The result was proven by sieve methods by Montgomery and Vaughan; an earlier result of Brun and Titchmarsh obtained a weaker version of this inequality with an additional multiplicative factor of .Improvements If ''q'' is relatively small, e.g., , then there exists a better bound: : This is due to Y. Motohashi (1973). He used a bilinear structure in the error term in the |
Primes In Arithmetic Progression
In number theory, primes in arithmetic progression are any sequence of at least three prime numbers that are consecutive terms in an arithmetic progression. An example is the sequence of primes (3, 7, 11), which is given by a_n = 3 + 4n for 0 \le n \le 2. According to the Green–Tao theorem, there exist arbitrarily long arithmetic progressions in the sequence of primes. Sometimes the phrase may also be used about primes which belong to an arithmetic progression which also contains composite numbers. For example, it can be used about primes in an arithmetic progression of the form an + b, where ''a'' and ''b'' are coprime which according to Dirichlet's theorem on arithmetic progressions contains infinitely many primes, along with infinitely many composites. For any integer k\geq 3, an AP-''k'' (also called PAP-''k'') is any sequence of k primes in arithmetic progression. An AP-k can be written as k primes of the form an+b, for fixed integers a (called the common difference) and b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
