|
Congruent Number
In number theory, a congruent number is a positive integer that is the area of a right triangle with three rational number sides. A more general definition includes all positive rational numbers with this property. The sequence of (integer) congruent numbers starts with :5, 6, 7, 13, 14, 15, 20, 21, 22, 23, 24, 28, 29, 30, 31, 34, 37, 38, 39, 41, 45, 46, 47, 52, 53, 54, 55, 56, 60, 61, 62, 63, 65, 69, 70, 71, 77, 78, 79, 80, 84, 85, 86, 87, 88, 92, 93, 94, 95, 96, 101, 102, 103, 109, 110, 111, 112, 116, 117, 118, 119, 120, ... For example, 5 is a congruent number because it is the area of a (20/3, 3/2, 41/6) triangle. Similarly, 6 is a congruent number because it is the area of a (3,4,5) triangle. 3 and 4 are not congruent numbers. If is a congruent number then is also a congruent number for any natural number (just by multiplying each side of the triangle by ), and vice versa. This leads to the observation that whether a nonzero rational number is a congruent number ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arithmetic Progression
An arithmetic progression or arithmetic sequence () is a sequence of numbers such that the difference between the consecutive terms is constant. For instance, the sequence 5, 7, 9, 11, 13, 15, . . . is an arithmetic progression with a common difference of 2. If the initial term of an arithmetic progression is a and the common difference of successive members is d, then the n-th term of the sequence (a_n) is given by: :a_n = a + (n - 1)d, If there are ''m'' terms in the AP, then a_m represents the last term which is given by: :a_m = a + (m - 1)d. A finite portion of an arithmetic progression is called a finite arithmetic progression and sometimes just called an arithmetic progression. The sum of a finite arithmetic progression is called an arithmetic series. Sum Computation of the sum 2 + 5 + 8 + 11 + 14. When the sequence is reversed and added to itself term by term, the resulting sequence has a single repeated value in it, equal to the sum of the first and last numbers ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Elliptic Curves
In mathematics, an elliptic curve is a smooth, projective, algebraic curve of genus one, on which there is a specified point . An elliptic curve is defined over a field and describes points in , the Cartesian product of with itself. If the field's characteristic is different from 2 and 3, then the curve can be described as a plane algebraic curve which consists of solutions for: :y^2 = x^3 + ax + b for some coefficients and in . The curve is required to be non-singular, which means that the curve has no cusps or self-intersections. (This is equivalent to the condition , that is, being square-free in .) It is always understood that the curve is really sitting in the projective plane, with the point being the unique point at infinity. Many sources define an elliptic curve to be simply a curve given by an equation of this form. (When the coefficient field has characteristic 2 or 3, the above equation is not quite general enough to include all non-singular cubic curve ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arithmetic Problems Of Plane Geometry
Arithmetic () is an elementary part of mathematics that consists of the study of the properties of the traditional operations on numbers—addition, subtraction, multiplication, division, exponentiation, and extraction of roots. In the 19th century, Italian mathematician Giuseppe Peano formalized arithmetic with his Peano axioms, which are highly important to the field of mathematical logic today. History The prehistory of arithmetic is limited to a small number of artifacts, which may indicate the conception of addition and subtraction, the best-known being the Ishango bone from central Africa, dating from somewhere between 20,000 and 18,000 BC, although its interpretation is disputed. The earliest written records indicate the Egyptians and Babylonians used all the elementary arithmetic operations: addition, subtraction, multiplication, and division, as early as 2000 BC. These artifacts do not always reveal the specific process used for solving problems, but the ch ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alice Silverberg
Alice Silverberg (born 1958) is professor of Mathematics and Computer Science at the University of California, Irvine. She was faculty at the Ohio State University from 1984 through 2004. She has given over 300 lectures at universities around the world, and she has brought attention to issues of sexism and discrimination through her blog ''Alice's Adventures in Numberland''. Research Silverberg's research concerns number theory and cryptography. With Karl Rubin, she introduced the CEILIDH system for torus-based cryptography in 2003, and she currently holds 10 patents related to cryptography. She is also known for her work on theoretical aspects of abelian varieties. Education and career Silverberg graduated from Harvard University in 1979, and received her Ph.D. from Princeton University in 1984 under the supervision of Goro Shimura. She began her academic career at Ohio State University in 1984 and became a full professor in 1996. She moved to the University of California at ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inventiones Mathematicae
''Inventiones Mathematicae'' is a mathematical journal published monthly by Springer Science+Business Media. It was established in 1966 and is regarded as one of the most prestigious mathematics journals in the world. The current managing editors are Camillo De Lellis (Institute for Advanced Study, Princeton) and Jean-Benoît Bost (University of Paris-Sud Paris-Sud University (French: ''Université Paris-Sud''), also known as University of Paris — XI (or as Université d'Orsay before 1971), was a French research university distributed among several campuses in the southern suburbs of Paris, in ...). Abstracting and indexing The journal is abstracted and indexed in: References External links *{{Official website, https://www.springer.com/journal/222 Mathematics journals Publications established in 1966 English-language journals Springer Science+Business Media academic journals Monthly journals ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
History Of The Theory Of Numbers
''History of the Theory of Numbers'' is a three-volume work by L. E. Dickson summarizing work in number theory up to about 1920. The style is unusual in that Dickson mostly just lists results by various authors, with little further discussion. The central topic of quadratic reciprocity and higher reciprocity laws is barely mentioned; this was apparently going to be the topic of a fourth volume that was never written . Volumes * Volume 1 - Divisibility and Primality - 486 pages * Volume 2 - Diophantine Analysis In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, such that the only solutions of interest are the integer ones. A linear Diophantine equation equates to a c ... - 803 pages * Volume 3 - Quadratic and Higher Forms - 313 pages References * * * * * * * * * * * * External links History of the Theory of Numbers - Volume 1at the Internet Archive. History of the Theory of Numbers - Volu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modular Arithmetic
In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book ''Disquisitiones Arithmeticae'', published in 1801. A familiar use of modular arithmetic is in the 12-hour clock, in which the day is divided into two 12-hour periods. If the time is 7:00 now, then 8 hours later it will be 3:00. Simple addition would result in , but clocks "wrap around" every 12 hours. Because the hour number starts over at zero when it reaches 12, this is arithmetic ''modulo'' 12. In terms of the definition below, 15 is ''congruent'' to 3 modulo 12, so "15:00" on a 24-hour clock is displayed "3:00" on a 12-hour clock. Congruence Given an integer , called a modulus, two integers and are said to be congruent modulo , if is a divisor of their difference (that is, if there is an integer such that ). Congruence modulo ... [...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. T ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dirichlet's Theorem On Arithmetic Progressions
In number theory, Dirichlet's theorem, also called the Dirichlet prime number theorem, states that for any two positive coprime integers ''a'' and ''d'', there are infinitely many primes of the form ''a'' + ''nd'', where ''n'' is also a positive integer. In other words, there are infinitely many primes that are congruent to ''a'' modulo ''d''. The numbers of the form ''a'' + ''nd'' form an arithmetic progression :a,\ a+d,\ a+2d,\ a+3d,\ \dots,\ and Dirichlet's theorem states that this sequence contains infinitely many prime numbers. The theorem, named after Peter Gustav Lejeune Dirichlet, extends Euclid's theorem that there are infinitely many prime numbers. Stronger forms of Dirichlet's theorem state that for any such arithmetic progression, the sum of the reciprocals of the prime numbers in the progression diverges and that different such arithmetic progressions with the same modulus have approximately the same proportions of primes. Equivalently, the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rational Point
In number theory and algebraic geometry, a rational point of an algebraic variety is a point whose coordinates belong to a given field. If the field is not mentioned, the field of rational numbers is generally understood. If the field is the field of real numbers, a rational point is more commonly called a real point. Understanding rational points is a central goal of number theory and Diophantine geometry. For example, Fermat's Last Theorem may be restated as: for , the Fermat curve of equation x^n+y^n=1 has no other rational points than , , and, if is even, and . Definition Given a field ''k'', and an algebraically closed extension ''K'' of ''k'', an affine variety ''X'' over ''k'' is the set of common zeros in K^n of a collection of polynomials with coefficients in ''k'': :f_1(x_1,\ldots,x_n)=0,\ldots, f_r(x_1,\dots,x_n)=0. These common zeros are called the ''points'' of ''X''. A ''k''-rational point (or ''k''-point) of ''X'' is a point of ''X'' that belongs to ''k''''n'', ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rank Of An Abelian Group
In mathematics, the rank, Prüfer rank, or torsion-free rank of an abelian group ''A'' is the cardinality of a maximal linearly independent subset. The rank of ''A'' determines the size of the largest free abelian group contained in ''A''. If ''A'' is torsion-free then it embeds into a vector space over the rational numbers of dimension rank ''A''. For finitely generated abelian groups, rank is a strong invariant and every such group is determined up to isomorphism by its rank and torsion subgroup. Torsion-free abelian groups of rank 1 have been completely classified. However, the theory of abelian groups of higher rank is more involved. The term rank has a different meaning in the context of elementary abelian groups. Definition A subset of an abelian group ''A'' is linearly independent (over Z) if the only linear combination of these elements that is equal to zero is trivial: if : \sum_\alpha n_\alpha a_\alpha = 0, \quad n_\alpha\in\mathbb, where all but finitely many coef ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
