|
Fermat's Theorem On Sums Of Two Squares
In additive number theory, Fermat's theorem on sums of two squares states that an odd prime ''p'' can be expressed as: :p = x^2 + y^2, with ''x'' and ''y'' integers, if and only if :p \equiv 1 \pmod. The prime numbers for which this is true are called Pythagorean primes. For example, the primes 5, 13, 17, 29, 37 and 41 are all congruent to 1 modulo 4, and they can be expressed as sums of two squares in the following ways: :5 = 1^2 + 2^2, \quad 13 = 2^2 + 3^2, \quad 17 = 1^2 + 4^2, \quad 29 = 2^2 + 5^2, \quad 37 = 1^2 + 6^2, \quad 41 = 4^2 + 5^2. On the other hand, the primes 3, 7, 11, 19, 23 and 31 are all congruent to 3 modulo 4, and none of them can be expressed as the sum of two squares. This is the easier part of the theorem, and follows immediately from the observation that all squares are congruent to 0 or 1 modulo 4. Since the Diophantus identity implies that the product of two integers each of which can be written as the sum of two squares is itself expressible as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Additive Number Theory
Additive number theory is the subfield of number theory concerning the study of subsets of integers and their behavior under addition. More abstractly, the field of additive number theory includes the study of abelian groups and commutative semigroups with an operation of addition. Additive number theory has close ties to combinatorial number theory and the geometry of numbers. Two principal objects of study are the sumset of two subsets ''A'' and ''B'' of elements from an abelian group ''G'', :A + B = \, and the h-fold sumset of ''A'', :hA = \underset\,. Additive number theory The field is principally devoted to consideration of ''direct problems'' over (typically) the integers, that is, determining the structure of ''hA'' from the structure of ''A'': for example, determining which elements can be represented as a sum from ''hA'', where ''A'' is a fixed subset.Nathanson (1996) II:1 Two classical problems of this type are the Goldbach conjecture Goldbach's conjecture is one ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Principal Ideal Domain
In mathematics, a principal ideal domain, or PID, is an integral domain in which every ideal is principal, i.e., can be generated by a single element. More generally, a principal ideal ring is a nonzero commutative ring whose ideals are principal, although some authors (e.g., Bourbaki) refer to PIDs as principal rings. The distinction is that a principal ideal ring may have zero divisors whereas a principal ideal domain cannot. Principal ideal domains are thus mathematical objects that behave somewhat like the integers, with respect to divisibility: any element of a PID has a unique decomposition into prime elements (so an analogue of the fundamental theorem of arithmetic holds); any two elements of a PID have a greatest common divisor (although it may not be possible to find it using the Euclidean algorithm). If and are elements of a PID without common divisors, then every element of the PID can be written in the form . Principal ideal domains are noetherian, they are i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Complexity
In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory. Both areas are highly related, as the complexity of an algorithm is always an upper bound on the complexity of the problem solved by this algorithm. Moreover, for designing efficient algorithms, it is often fundamental to compare the complexity of a specific algorithm to the complexity of the problem to be solved. Also, in most cases, the only thing that is known about the complexity of a problem is that it is lower than the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Exponential Function
The exponential function is a mathematical function denoted by f(x)=\exp(x) or e^x (where the argument is written as an exponent). Unless otherwise specified, the term generally refers to the positive-valued function of a real variable, although it can be extended to the complex numbers or generalized to other mathematical objects like matrices or Lie algebras. The exponential function originated from the notion of exponentiation (repeated multiplication), but modern definitions (there are several equivalent characterizations) allow it to be rigorously extended to all real arguments, including irrational numbers. Its ubiquitous occurrence in pure and applied mathematics led mathematician Walter Rudin to opine that the exponential function is "the most important function in mathematics". The exponential function satisfies the exponentiation identity e^ = e^x e^y \text x,y\in\mathbb, which, along with the definition e = \exp(1), shows that e^n=\underbrace_ for positi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Numeral Base
In a positional numeral system, the radix or base is the number of unique numerical digit, digits, including the digit zero, used to represent numbers. For example, for the decimal/denary system (the most common system in use today) the radix (base number) is ten, because it uses the ten digits from 0 through 9. In any standard positional numeral system, a number is conventionally written as with ''x'' as the String (computer science), string of digits and ''y'' as its base, although for base ten the subscript is usually assumed (and omitted, together with the pair of parentheses), as it is the most common way to express value (mathematics), value. For example, (100)10 is equivalent to 100 (the decimal system is implied in the latter) and represents the number one hundred, while (100)2 (in the binary system (numeral), binary system with base 2) represents the number four. Etymology :wikt:radix, ''Radix'' is a Latin word for "root". ''Root'' can be considered a synonym for '' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithm
In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can perform automated deductions (referred to as automated reasoning) and use mathematical and logical tests to divert the code execution through various routes (referred to as automated decision-making). Using human characteristics as descriptors of machines in metaphorical ways was already practiced by Alan Turing with terms such as "memory", "search" and "stimulus". In contrast, a heuristic is an approach to problem solving that may not be fully specified or may not guarantee correct or optimal results, especially in problem domains where there is no well-defined correct or optimal result. As an effective method, an algorithm can be expressed within a finite amount of space ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Joseph-Louis Lagrange
Joseph-Louis Lagrange (born Giuseppe Luigi LagrangiaJoseph-Louis Lagrange, comte de l’Empire ''Encyclopædia Britannica'' or Giuseppe Ludovico De la Grange Tournier; 25 January 1736 – 10 April 1813), also reported as Giuseppe Luigi Lagrange or Lagrangia, was an Italian and , later naturalized |
Blaise Pascal
Blaise Pascal ( , , ; ; 19 June 1623 – 19 August 1662) was a French mathematician, physicist, inventor, philosopher, and Catholic writer. He was a child prodigy who was educated by his father, a tax collector in Rouen. Pascal's earliest mathematical work was on conic sections; he wrote a significant treatise on the subject of projective geometry at the age of 16. He later corresponded with Pierre de Fermat on probability theory, strongly influencing the development of modern economics and social science. In 1642, while still a teenager, he started some pioneering work on calculating machines (called Pascal's calculators and later Pascalines), establishing him as one of the first two inventors of the mechanical calculator. Like his contemporary René Descartes, Pascal was also a pioneer in the natural and applied sciences. Pascal wrote in defense of the scientific method and produced several controversial results. He made important contributions to the study of fluids, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Law Of Quadratic Reciprocity
In number theory, the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers. Due to its subtlety, it has many formulations, but the most standard statement is: This law, together with its supplements, allows the easy calculation of any Legendre symbol, making it possible to determine whether there is an integer solution for any quadratic equation of the form x^2\equiv a \bmod p for an odd prime p; that is, to determine the "perfect squares" modulo p. However, this is a non-constructive result: it gives no help at all for finding a ''specific'' solution; for this, other methods are required. For example, in the case p\equiv 3 \bmod 4 using Euler's criterion one can give an explicit formula for the "square roots" modulo p of a quadratic residue a, namely, :\pm a^ indeed, :\left (\pm a^ \right )^2=a^=a\cdot a^\equiv a\left(\frac\right)=a \bmod p. This formula only works if it is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ideal Norm
In commutative algebra, the norm of an ideal is a generalization of a norm of an element in the field extension. It is particularly important in number theory since it measures the size of an ideal of a complicated number ring in terms of an ideal in a less complicated ring. When the less complicated number ring is taken to be the ring of integers, Z, then the norm of a nonzero ideal ''I'' of a number ring ''R'' is simply the size of the finite quotient ring ''R''/''I''. Relative norm Let ''A'' be a Dedekind domain with field of fractions ''K'' and integral closure of ''B'' in a finite separable extension ''L'' of ''K''. (this implies that ''B'' is also a Dedekind domain.) Let \mathcal_A and \mathcal_B be the ideal groups of ''A'' and ''B'', respectively (i.e., the sets of nonzero fractional ideals.) Following the technique developed by Jean-Pierre Serre, the norm map :N_\colon \mathcal_B \to \mathcal_A is the unique group homomorphism that satisfies :N_(\mathfrak q) = \math ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Element
In mathematics, specifically in abstract algebra, a prime element of a commutative ring is an object satisfying certain properties similar to the prime numbers in the integers and to irreducible polynomials. Care should be taken to distinguish prime elements from irreducible elements, a concept which is the same in UFDs but not the same in general. Definition An element of a commutative ring is said to be prime if it is not the zero element or a unit and whenever divides for some and in , then divides or divides . With this definition, Euclid's lemma is the assertion that prime numbers are prime elements in the ring of integers. Equivalently, an element is prime if, and only if, the principal ideal generated by is a nonzero prime ideal. (Note that in an integral domain, the ideal is a prime ideal, but is an exception in the definition of 'prime element'.) Interest in prime elements comes from the fundamental theorem of arithmetic, which asserts that each non ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quadratic Field
In algebraic number theory, a quadratic field is an algebraic number field of degree two over \mathbf, the rational numbers. Every such quadratic field is some \mathbf(\sqrt) where d is a (uniquely defined) square-free integer different from 0 and 1. If d>0, the corresponding quadratic field is called a real quadratic field, and, if d<0, it is called an imaginary quadratic field or a complex quadratic field, corresponding to whether or not it is a subfield of the field of the s. Quadratic fields have been studied in great depth, initially as part of the theory of binary quadratic forms. There remain some unsolved problems. The |
.png "Click for more on -> Blaise Pascal")
