|
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. It 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 o ... [...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] |
Parity (mathematics)
In mathematics, parity is the Property (mathematics), property of an integer of whether it is even or odd. An integer is even if it is divisible by 2, and odd if it is not.. For example, −4, 0, and 82 are even numbers, while −3, 5, 23, and 69 are odd numbers. The above definition of parity applies only to integer numbers, hence it cannot be applied to numbers with decimals or fractions like 1/2 or 4.6978. 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; otherwise it is even—as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arithmetic Functions
In number theory, an arithmetic, arithmetical, or number-theoretic function is generally any function whose domain is the set of 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''". There is a larger class of number-theoretic functions that do not fit this definition, for example, the prime-counting functions. This article provides links to functions of both classes. 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''. 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'' and ''n''; * ... [...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 followed by ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jacobi's Four-square Theorem
In number theory, Jacobi's four-square theorem gives a formula for the number of ways that a given positive integer can be represented as the sum of four squares (of integers). 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 as the sum of four squares is eight times the sum of the divisors of if is odd and 24 times the sum of the odd divisors of if is even (see divisor function), i.e. r_4(n) = \begin \displaystyle 8\sum_ m & \text n \text, \\ 2pt \displaystyle 24 \sum_ m & \text n \text. \end Equivalently, it is eight times the sum of all its divisors which are not divisible by 4, i.e. r_4(n) = ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Integer Partition
In number theory and combinatorics, a partition of a non-negative integer , also called an integer partition, is a way of writing as a summation, sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition. (If order matters, the sum becomes a composition (combinatorics), composition.) For example, can be partitioned in five distinct ways: : : : : : The only partition of zero is the empty sum, having no parts. The order-dependent composition is the same partition as , and the two distinct compositions and represent the same partition as . An individual summand in a partition is called a part. The number of partitions of is given by the Partition function (number theory), partition function . So . The notation means that is a partition of . Partitions can be graphically visualized with Young diagrams or Ferrers diagrams. They occur in a number of branches of mathematics and physics, including the study of symm ... [...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. Theta functions are parametrized by points in a tube domain inside a complex Lagrangian Grassmannian, namely the Siegel upper half space. 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 ... [...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 '' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Generating Function
In mathematics, a generating function is a representation of an infinite sequence of numbers as the coefficients of a formal power series. Generating functions are often expressed in closed form (rather than as a series), by some expression involving operations on the formal series. There are various types of generating functions, including ordinary generating functions, exponential generating functions, Lambert series, Bell series, and Dirichlet series. Every sequence in principle has a generating function of each type (except that Lambert and Dirichlet series require indices to start at 1 rather than 0), but the ease with which they can be handled may differ considerably. The particular generating function, if any, that is most useful in a given context will depend upon the nature of the sequence and the details of the problem being addressed. Generating functions are sometimes called generating series, in that a series of terms can be said to be the generator of its sequence ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Closed-form Expression
In mathematics, an expression or equation is in closed form if it is formed with constants, variables, and a set of functions considered as ''basic'' and connected by arithmetic operations (, and integer powers) and function composition. Commonly, the basic functions that are allowed in closed forms are ''n''th root, exponential function, logarithm, and trigonometric functions. However, the set of basic functions depends on the context. For example, if one adds polynomial roots to the basic functions, the functions that have a closed form are called elementary functions. The ''closed-form problem'' arises when new ways are introduced for specifying mathematical objects, such as limits, series, and integrals: given an object specified with such tools, a natural problem is to find, if possible, a ''closed-form expression'' of this object; that is, an expression of this object in terms of previous ways of specifying it. Example: roots of polynomials The quadratic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kronecker Symbol
In number theory, the Kronecker symbol, written as \left(\frac an\right) or (a, n), is a generalization of the Jacobi symbol to all integers n. It was introduced by . Definition Let n be a non-zero integer, with prime factorization :n=u \cdot p_1^ \cdots p_k^, where u is a unit (i.e., u=\pm1), and the p_i are primes. Let a be an integer. The Kronecker symbol \left(\frac\right) is defined by : \left(\frac\right) := \left(\frac\right) \prod_^k \left(\frac\right)^. For odd p_i, the number \left(\frac\right) is simply the usual Legendre symbol. This leaves the case when p_i=2. We define \left(\frac\right) by : \left(\frac\right) := \begin 0 & \mboxa\mbox \\ 1 & \mbox a \equiv \pm1 \pmod, \\ -1 & \mbox a \equiv \pm3 \pmod. \end Since it extends the Jacobi symbol, the quantity \left(\frac\right) is simply 1 when u=1. When u=-1, we define it by : \left(\frac\right) := \begin -1 & \mboxa 0. Table of values The following is a table of values of Kronecker symbol \left(\ ... [...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. Biography Jacobi was born of Ashkenazi Jewish parentage in Potsdam on 10 December 1804. He was the second of four children of a banker, Simon Jacobi. His elder brother, Moritz, 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, mathematics, sciences, etc. As a result of the good education he had received from his uncle, as well as his own remarkable abilities, after less than half a year Jacobi was moved to the senior year despite his young age. However, as the Unive ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
