|
Sum Of Squares Function
In number theory, the sum of squares function is an arithmetic function that gives the number of representations for a given positive integer as the sum of squares, where representations that differ only in the order of the summands or in the signs of the numbers being squared are counted as different, and is denoted by . Definition The function is defined as :r_k(n) = , \, where , \,\ , denotes the cardinality of a set. In other words, is the number of ways can be written as a sum of squares. For example, r_2(1) = 4 since 1 = 0^2 + (\pm 1)^2 = (\pm 1)^2 + 0^2 where each sum has two sign combinations, and also r_2(2) = 4 since 2 = (\pm 1)^2 + (\pm 1)^2 with four sign combinations. On the other hand, r_2(3) = 0 because there is no way to represent 3 as a sum of two squares. Formulae ''k'' = 2 The number of ways to write a natural number as sum of two squares is given by . It is given explicitly by :r_2(n) = 4(d_1(n)-d_3(n)) where is the number of divisors of wh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Number Theory
Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic function, integer-valued functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mathematics is the queen of the sciences—and number theory is the queen of mathematics."German original: "Die Mathematik ist die Königin der Wissenschaften, und die Arithmetik ist die Königin der Mathematik." Number theorists study prime numbers as well as the properties of mathematical objects made out of 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 are often best understood through the study of Complex analysis, analytical objects (for example, the Riemann zeta function) that encode properties of the integers, primes ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Table Of Prime Factors
The tables contain the prime factorization of the natural numbers from 1 to 1000. When ''n'' is a prime number, the prime factorization is just ''n'' itself, written in bold below. The number 1 is called a unit. It has no prime factors and is neither prime nor composite. Properties Many properties of a natural number ''n'' can be seen or directly computed from the prime factorization of ''n''. *The multiplicity of a prime factor ''p'' of ''n'' is the largest exponent ''m'' for which ''pm'' divides ''n''. The tables show the multiplicity for each prime factor. If no exponent is written then the multiplicity is 1 (since ''p'' = ''p''1). The multiplicity of a prime which does not divide ''n'' may be called 0 or may be considered undefined. *Ω(''n''), the big Omega function, is the number of prime factors of ''n'' counted with multiplicity (so it is the sum of all prime factor multiplicities). *A prime number has Ω(''n'') = 1. The first: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 3 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arithmetic Functions
In number theory, an arithmetic, arithmetical, or number-theoretic function is for most authors any function ''f''(''n'') whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of ''n''". An example of an arithmetic function is the divisor function whose value at a positive integer ''n'' is equal to the number of divisors of ''n''. There is a larger class of number-theoretic functions that do not fit the above definition, for example, the prime-counting functions. This article provides links to functions of both classes. Arithmetic functions are often extremely irregular (see table), but some of them have series expansions in terms of Ramanujan's sum. Multiplicative and additive functions An arithmetic function ''a'' is * completely additive if ''a''(''mn'') = ''a''(''m'') + ''a''(''n'') for all natural numbers ''m'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gauss Circle Problem
In mathematics, the Gauss circle problem is the problem of determining how many integer lattice points there are in a circle centered at the origin and with radius r. This number is approximated by the area of the circle, so the real problem is to accurately bound the error term describing how the number of points differs from the area. The first progress on a solution was made by Carl Friedrich Gauss, hence its name. The problem Consider a circle in \mathbb^2 with center at the origin and radius r\ge 0. Gauss's circle problem asks how many points there are inside this circle of the form (m,n) where m and n are both integers. Since the equation of this circle is given in Cartesian coordinates by x^2+y^2= r^2, the question is equivalently asking how many pairs of integers ''m'' and ''n'' there are such that :m^2+n^2\leq r^2. If the answer for a given r is denoted by N(r) then the following list shows the first few values of N(r) for ''r'' an integer between 0 and 12 follow ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jacobi's Four-square Theorem
Jacobi's four-square theorem gives a formula for the number of ways that a given positive integer ''n'' can be represented as the sum of four squares. History The theorem was proved in 1834 by Carl Gustav Jakob Jacobi. Theorem Two representations are considered different if their terms are in different order or if the integer being squared (not just the square) is different; to illustrate, these are three of the eight different ways to represent 1: : \begin & 1^2 + 0^2 + 0^2 + 0^2 \\ & 0^2 + 1^2 + 0^2 + 0^2 \\ & (-1)^2 + 0^2 + 0^2 + 0^2. \end The number of ways to represent n as the sum of four squares is eight times the sum of the divisors of ''n'' if ''n'' is odd and 24 times the sum of the odd divisors of ''n'' if ''n'' is even (see divisor function), i.e. : r_4(n)=\begin8\sum\limits_m&\textn\text\\2pt24\sum\limits_m&\textn\text. \end Equivalently, it is eight times the sum of all its divisors which are not divisible by 4, i.e. :r_4(n)=8\sum_m. We may also write this as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jacobi Theta Function
In mathematics, theta functions are special functions of several complex variables. They show up in many topics, including Abelian varieties, moduli spaces, quadratic forms, and solitons. As Grassmann algebras, they appear in quantum field theory. The most common form of theta function is that occurring in the theory of elliptic functions. With respect to one of the complex variables (conventionally called ), a theta function has a property expressing its behavior with respect to the addition of a period of the associated elliptic functions, making it a quasiperiodic function. In the abstract theory this quasiperiodicity comes from the cohomology class of a line bundle on a complex torus, a condition of descent. One interpretation of theta functions when dealing with the heat equation is that "a theta function is a special function that describes the evolution of temperature on a segment domain subject to certain boundary conditions". Throughout this article, (e^)^ should b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sequence
In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is called the ''length'' of the sequence. Unlike a set, the same elements can appear multiple times at different positions in a sequence, and unlike a set, the order does matter. Formally, a sequence can be defined as a function from natural numbers (the positions of elements in the sequence) to the elements at each position. The notion of a sequence can be generalized to an indexed family, defined as a function from an ''arbitrary'' index set. For example, (M, A, R, Y) is a sequence of letters with the letter 'M' first and 'Y' last. This sequence differs from (A, R, M, Y). Also, the sequence (1, 1, 2, 3, 5, 8), which contains the number 1 at two different positions, is a valid sequence. Sequences can be ''finite'', as in these examples, or ''infi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Closed-form Expression
In mathematics, a closed-form expression is a mathematical expression that uses a finite number of standard operations. It may contain constants, variables, certain well-known operations (e.g., + − × ÷), and functions (e.g., ''n''th root, exponent, logarithm, trigonometric functions, and inverse hyperbolic functions), but usually no limit, differentiation, or integration. The set of operations and functions may vary with author and context. Example: roots of polynomials The solutions of any quadratic equation with complex coefficients can be expressed in closed form in terms of addition, subtraction, multiplication, division, and square root extraction, each of which is an elementary function. For example, the quadratic equation :ax^2+bx+c=0, is tractable since its solutions can be expressed as a closed-form expression, i.e. in terms of elementary functions: :x=\frac. Similarly, solutions of cubic and quartic (third and fourth degree) equations can be expresse ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Carl Gustav Jakob Jacobi
Carl Gustav Jacob Jacobi (; ; 10 December 1804 – 18 February 1851) was a German mathematician who made fundamental contributions to elliptic functions, dynamics, differential equations, determinants, and number theory. His name is occasionally written as Carolus Gustavus Iacobus Iacobi in his Latin books, and his first name is sometimes given as Karl. Jacobi was the first Jewish mathematician to be appointed professor at a German university. Biography Jacobi was born of Ashkenazi Jewish parentage in Potsdam on 10 December 1804. He was the second of four children of banker Simon Jacobi. His elder brother Moritz von Jacobi would also become known later as an engineer and physicist. He was initially home schooled by his uncle Lehman, who instructed him in the classical languages and elements of mathematics. In 1816, the twelve-year-old Jacobi went to the Potsdam Gymnasium, where students were taught all the standard subjects: classical languages, history, philology, mathema ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Class Number (number Theory)
In number theory, the ideal class group (or class group) of an algebraic number field is the quotient group where is the group of fractional ideals of the ring of integers of , and is its subgroup of principal ideals. The class group is a measure of the extent to which unique factorization fails in the ring of integers of . The order of the group, which is finite, is called the class number of . The theory extends to Dedekind domains and their field of fractions, for which the multiplicative properties are intimately tied to the structure of the class group. For example, the class group of a Dedekind domain is trivial if and only if the ring is a unique factorization domain. History and origin of the ideal class group Ideal class groups (or, rather, what were effectively ideal class groups) were studied some time before the idea of an ideal was formulated. These groups appeared in the theory of quadratic forms: in the case of binary integral quadratic forms, as put into s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Squarefree Number
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. The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
