Fact-checked by Grok 2 weeks ago

Perfect square

A perfect square, also known as a square number, is an integer that can be expressed as the square of another integer.^[1] For instance, 0, 1, 4, 9, 16, 25, 36, 49, and 64 are perfect squares, corresponding to $0^2, $1^2, $2^2, $3^2, $4^2, $5^2, $6^2, $7^2, and $8^2, respectively.^[2] Perfect squares are central to number theory, where they demonstrate distinctive arithmetic properties that distinguish them from other integers.^[1] In their prime factorization, every exponent must be even, implying that if a prime p divides a perfect square, then p^2 also divides it.^[1] Moreover, perfect squares exhibit restrictions on their possible residues modulo small primes; for example, modulo 4, they are congruent only to 0 or 1, and modulo 3, only to 0 or 1.^[1] The units digit of a perfect square can only be 0, 1, 4, 5, 6, or 9, a consequence of squaring integers based on their units digits.^[2] No two positive perfect squares are consecutive integers, as the difference between consecutive squares (n+1)^2 - n^2 = 2n + 1 exceeds 1 for n \geq 1.^[2] These traits make perfect squares essential in topics like quadratic residues, Diophantine equations, and the study of sums of squares.^[1]

Mathematical Foundations

Definition

In mathematics, a perfect square is defined as an integer that results from multiplying an integer by itself, expressed as k = n^2 where n is a non-negative integer.^[3] This includes zero, since $0 = 0^2, and one, since $1 = 1^2.^[3] Examples of perfect squares among small non-negative integers are 0, 1, 4, and 9, while numbers such as 2, 3, and 5 are not perfect squares because their square roots are not integers.^[3]

Basic Properties

A perfect square k = n^2, where n is an integer, has the property that in its prime factorization, every exponent is even; this is equivalent to the definition of a perfect square, as it ensures the number can be expressed as the square of an integer.^[4] For example, $36 = 2^2 \cdot 3^2 has even exponents for both primes. This even-exponent condition holds for all primes dividing the perfect square.^[4] By definition, every perfect square k has an integer square root n, satisfying \sqrt{k} = n where k = n^2.^[4] This integer root distinguishes perfect squares from non-squares, where the square root is irrational.^[4] Perfect squares exhibit quadratic growth, as the sequence $1^2, 2^2, [3^2](/page/3-2), \dots increases nonlinearly. The difference between consecutive perfect squares is given by (n+1)^2 - n^2 = 2n + 1, which increases linearly with n.^[5] For instance, $9 - 4 = 5 = 2 \cdot 2 + 1. In terms of parity, all perfect squares are congruent to 0 or 1 modulo 4, as verified by checking residues: $0^2 \equiv 0 \pmod{4}, $1^2 \equiv 1 \pmod{4}, $2^2 \equiv 0 \pmod{4}, and $3^2 \equiv 1 \pmod{4}. No perfect square is congruent to 2 or 3 modulo 4.^[6]

Examples and Patterns

Small Perfect Squares

Perfect squares provide an accessible entry point to understanding the concept, as the smallest examples are straightforward to compute and recognize. These numbers arise from squaring non-negative integers, beginning with $0^2 = [0](/page/0) and progressing through small values of n.^[3]^[7] The first 15 perfect squares (for n = 0 to $15) are as follows:

n	n^2
0	0
1	1
2	4
3	9
4	16
5	25
6	36
7	49
8	64
9	81
10	100
11	121
12	144
13	169
14	196
15	225

This sequence illustrates the rapid growth of perfect squares even at small scales.^[7]

Sequences and Formulas

The sequence of perfect squares consists of the terms s_n = n^2 for each positive integer n, yielding 1, 4, 9, 16, 25, and so forth.^[3] The differences between consecutive perfect squares form an arithmetic sequence of odd integers: s_{n+1} - s_n = 2n + 1, starting with 3 for n=1, then 5, 7, and continuing indefinitely.^[3] This pattern reflects the incremental growth in the squares, where each subsequent square adds an increasingly larger odd number to the previous one.^[8] The relation s_{n+1} = s_n + 2n + 1 follows directly from the binomial expansion of (n+1)^2 = n^2 + 2n + 1, providing a recursive method to generate the sequence.^[3] A closed-form expression for the sum of the first n perfect squares is \sum_{k=1}^n k^2 = \frac{n(n+1)(2n+1)}{6}, which can be derived using mathematical induction or telescoping series.^[9] Perfect squares exhibit distinct patterns in their digital representations, particularly modulo 10, where possible residues are limited to 0, 1, 4, 5, 6, or 9; thus, no perfect square ends in the digits 2, 3, 7, or 8.^[3]

Advanced Concepts

Perfect Squares in Number Theory

In number theory, perfect squares play a central role in the study of sums of squares and Diophantine approximations. One foundational result is Lagrange's four-square theorem, which asserts that every natural number can be expressed as the sum of four integer squares. This theorem, first proved by Joseph-Louis Lagrange in 1770, implies that the set of sums of four squares encompasses all positive integers, highlighting the ubiquity of squares in additive representations. A related but more restrictive characterization is provided by Fermat's theorem on sums of two squares, which states that a positive integer can be written as the sum of two integer squares if and only if, in its prime factorization, every prime congruent to 3 modulo 4 appears with an even exponent. Formulated by Pierre de Fermat in the 17th century and rigorously proved later by Leonhard Euler, this criterion links the arithmetic structure of numbers directly to quadratic forms. For example, the number 5 = 1² + 2² satisfies the condition since its only prime factor is 5 ≡ 1 mod 4, while 7 cannot be expressed this way as 7 ≡ 3 mod 4 with odd exponent.^[10] Perfect squares also underpin the concept of quadratic residues in modular arithmetic. For an odd prime p, an integer a not divisible by p is a quadratic residue modulo p if there exists an integer x such that x^2 \equiv a \pmod{p}; thus, the quadratic residues modulo p are precisely the distinct nonzero perfect squares modulo p. There are exactly (p-1)/2 such residues, as the map x \mapsto x^2 \pmod{p} pairs nonzero elements symmetrically. This framework is essential for understanding Legendre symbols and quadratic reciprocity. Another key application arises in solving Pell's equation, x^2 - d y^2 = 1, where d is a positive square-free integer. The positive integer solutions (x, y) correspond to the units of norm 1 in the ring of integers of the real quadratic field \mathbb{Q}(\sqrt{d}), and the fundamental solution can be derived from the continued fraction expansion of \sqrt{d}. Let l be the period length of the continued fraction. If l is even, the fundamental solution is the (l-1)-th convergent h_{l-1}/k_{l-1}. If l is odd, the l-th convergent gives a solution to x^2 - d y^2 = -1, and the fundamental solution to the equation with +1 is the (2l-1)-th convergent h_{2l-1}/k_{2l-1}. All subsequent solutions are generated by powers of this fundamental unit, illustrating the deep connection between squares, continued fractions, and algebraic number theory.^[11] Finally, perfect squares exhibit zero natural density within the natural numbers. The number of perfect squares up to N is asymptotically \sqrt{N}, so the proportion \sqrt{N}/N = 1/\sqrt{N} tends to 0 as N \to \infty, confirming their sparsity despite their structural importance.^[12]

Diophantine Equations Involving Squares

Diophantine equations involving perfect squares are polynomial equations with integer coefficients where the unknowns appear as squares, and the goal is to find all integer solutions. These equations often arise in number theory and connect to deeper structures like algebraic number fields and elliptic curves. Key examples include equations where sums of squares equal another square or a cube plus a constant, with solution methods relying on parametrization, infinite descent, and factorization in specialized rings. A fundamental Diophantine equation is x^2 + y^2 = z^2, whose positive integer solutions (x, y, z) form Pythagorean triples. All primitive solutions, where \gcd(x, y, z) = 1, are generated by the parametrization: for integers m > n > 0 with m - n odd and \gcd(m, n) = 1, set x = m^2 - n^2, y = 2mn, z = m^2 + n^2.^[13] This formula, attributed to Euclid in Elements Book X, Propositions 28–29, produces all such triples without common factors. Non-primitive solutions are scalar multiples k(x, y, z) for integer k > 1. A classic example is the triple (3, 4, 5), obtained from m=2, n=1, satisfying $3^2 + 4^2 = 5^2 = 25.^[13] Methods for solving x^2 + y^2 = z^2 include infinite descent, introduced by Fermat, which assumes a minimal solution and derives a smaller one, leading to a contradiction unless the solution is trivial.^[14] Another approach uses factorization in the ring of Gaussian integers \mathbb{Z}, where z^2 = (x + yi)(x - yi) and unique factorization implies that x + yi and x - yi are squares of Gaussian primes of the form a + bi with a > b > 0, a - b odd, and \gcd(a, b) = 1, yielding the same parametrization as Euclid's formula.^[13] Another significant equation is the Mordell equation y^2 = x^3 + k for fixed integer k \neq 0, whose integer solutions correspond to integer points on the elliptic curve E_k: y^2 = x^3 + k. The Mordell-Weil theorem states that the group of rational points on E_k is finitely generated, and thus the integer points form a finite set whose size depends on the rank and torsion of the group.^[15] Solutions can be found using descent methods on the elliptic curve group or by computing the rank via two-descent, though explicit parametrization is generally unavailable except for small k. For instance, when k = 1, solutions include (x, y) = (-1, 0), (0, \pm 1), (2, \pm 3).^[15] Mordell proved finiteness in 1922, with complete lists of solutions known for all |k| \leq 10^4 via computational methods tied to elliptic curve theory.^[16]

Applications

In Geometry

In geometry, the area of a square with side length n, where n is a positive integer, is given by n^2, which is a perfect square. This relationship directly links the algebraic property of perfect squares to the measurement of geometric figures, emphasizing how squaring a length yields an integral area. For instance, a square with side 3 has area 9, illustrating the foundational role of perfect squares in basic Euclidean geometry.^[3] Perfect squares also arise in the context of distances within the integer lattice, a grid of points with integer coordinates. The squared distance between the origin (0,0) and a lattice point (a,b), where a and b are integers, is a^2 + b^2; this distance is an integer d if and only if a^2 + b^2 = d^2, a perfect square. Such integer distances connect to Pythagorean triples, where the hypotenuse length is integer, as explored in related Diophantine contexts.^[17] A notable geometric application involves tiling and dissections, particularly "squaring the square," which entails partitioning a square into smaller squares of unequal integer side lengths, ensuring all component areas are distinct perfect squares. The problem, posed in the early 20th century, was solved affirmatively in 1939 by Roland Sprague with a dissection using 55 squares, though it contained a smaller squared rectangle; the first simple perfect squared square, free of such substructures and using 21 squares, was discovered by A. J. W. Duijvestijn in 1978. These constructions highlight the intricate spatial arrangements possible with perfect squares.^[18] In coordinate geometry, perfect squares define circles with integer radii. The standard equation for a circle centered at the origin with radius r, an integer, is x^2 + y^2 = r^2; lattice points on this circle correspond to integer solutions (x,y) where x^2 + y^2 equals the perfect square r^2. The number of such points equals four times the number of ways r^2 can be expressed as a sum of two positive squares (accounting for symmetries), a quantity denoted r_2(r^2) in analytic number theory. For example, the circle x^2 + y^2 = 25 passes through eight lattice points, including (0,5), (3,4), and their sign variants.^[17]

In Computing and Algorithms

In computing, algorithms for computing the integer square root of a non-negative integer n, denoted \lfloor \sqrt{n} \rfloor, are essential for various numerical tasks. One widely used approach is Newton's method, adapted for integers, which iteratively refines an initial guess through the recurrence x_{k+1} = \left\lfloor \frac{x_k + \left\lfloor \frac{n}{x_k} \right\rfloor}{2} \right\rfloor, starting from an overestimate like x_0 = 2^{\lceil \log_2 (n+1)/2 \rceil}. This method converges quadratically, requiring O(\log \log n) iterations for n-bit inputs, and is implemented in libraries like GNU Multiple Precision Arithmetic Library (GMP) for multi-precision numbers via a recursive application that bottoms out in a single-limb Newton's iteration.^[19]^[20] An alternative is binary search over the range [0, n], checking midpoints by squaring and comparing to n, which guarantees an exact result in O(\log n) time due to the monotonicity of the square function.^[21] To test whether a positive integer n is a perfect square, a standard procedure computes the integer square root s = \lfloor \sqrt{n} \rfloor using either hardware floating-point square root (if n fits in machine word size) followed by verification via s^2 = n, achieving O(1) amortized time on modern processors, or binary search for arbitrary precision, yielding O(\log n) time complexity. This verification step ensures exactness, as floating-point approximations may introduce rounding errors for large n. In practice, such checks are optimized in big-integer libraries by first testing quadratic residuosity modulo small primes to quickly reject non-squares.^[22]^[23] Perfect squares appear in hashing techniques, notably the mid-square method, where a key k is squared (k^2), and the middle digits of the result are extracted and taken modulo the table size m to produce the hash value h(k), leveraging the distribution of middle bits in squares for better uniformity in numeric keys. This approach, while simple, can be part of constructing perfect hash functions for static sets by combining with modular arithmetic to minimize collisions.^[24] For handling large perfect squares in cryptography, libraries like GMP provide efficient routines for multi-precision arithmetic, including square root extraction and perfect square testing via trial division and residuosity checks modulo small integers, essential for applications such as verifying that RSA moduli n = pq (with distinct primes p, q) are not perfect squares, as square moduli would be trivially factorable by taking the integer square root. Ensuring non-squareness is a standard step in RSA key generation to maintain security, with GMP's algorithms scaling to thousands of bits.^[23]^[25]

History

Etymology and Early Recognition

The term "perfect square" in mathematics derives from the Latin adjective perfectus, meaning "completed" or "finished," which historically connoted completeness when applied to integer powers, with "square" stemming from the geometric figure defined by four equal sides, traced to the Latin exquadrare ("to make square-like").^[26]^[27] Early recognition of perfect squares appears in ancient Mesopotamian records, where Babylonian scribes around 1800 BCE compiled tables of squares as integral components of their multiplication systems. These clay tablets from the Old Babylonian period (c. 1900–1600 BCE), such as those listing squares of numbers up to 59, supported practical computations for areas, lengths, and approximations like √2 on tablet YBC 7289.^[28] In ancient India, the Sulba Sutras—Vedic texts dated between approximately 800 and 500 BCE, including the Baudhayana Sulbasutra (c. 800 BCE) and Apastamba Sulbasutra (c. 600 BCE)—employed squares centrally in constructing fire altars for rituals. These manuals detail geometric methods to build squares equal in area to rectangles or sums of squares, implicitly acknowledging perfect squares like 1, 4, and 9 through precise altar dimensions and area equivalences essential for symmetry and efficacy.^[29] Greek mathematics advanced this understanding with Euclid's Elements (c. 300 BCE), where Book II treats squares explicitly as geometric figures bounded by four equal sides. Propositions in this book, such as II.4 (relating the square on a line to squares on its segments plus twice their rectangle) and II.14 (constructing a square equal to any rectilinear figure), integrate squares into proofs of area relations, laying foundational geometric principles.^[30]

Key Developments

During the Islamic Golden Age, Muhammad ibn Musa al-Khwarizmi advanced the treatment of perfect squares in algebra around 820 CE, presenting them as unknowns in quadratic equations and developing methods like completing the square to solve forms such as "a square plus roots equal to a number."^[31] His work in Al-Kitab al-mukhtasar fi hisab al-jabr wal-muqabala laid foundational geometric and rhetorical approaches to squares, influencing subsequent algebraic traditions.^[32] In the Renaissance, Gerolamo Cardano and contemporaries in the 16th century extended explorations of squares to higher-degree equations, incorporating square roots and related expressions in the solution of cubics published in his 1545 Ars Magna.^[33] This built on earlier Italian efforts by Scipione del Ferro and Niccolò Tartaglia, integrating sums involving squares into radical-based formulas for cubic roots, marking a shift toward symbolic algebra.^[34] The 17th and 18th centuries saw significant progress in sums of squares, with Pierre de Fermat announcing in the 1630s that an odd prime can be expressed as the sum of two squares if and only if it is congruent to 1 modulo 4, a result later proved by Euler in 1749 using infinite descent.^[35] Euler further contributed in 1747 by establishing the identity for the product of two sums of four squares equaling another such sum, conjecturing that every natural number is a sum of four squares; Joseph-Louis Lagrange rigorously proved this theorem in 1770, completing a key identity in additive number theory.^[36]^[37] In the 19th and 20th centuries, G. H. Hardy and J. E. Littlewood advanced the understanding of sums of squares through their circle method, introduced in the 1920s, which provided asymptotic estimates for the number of representations of integers as sums of k squares and resolved cases of Waring's problem for squares.^[38] Computational milestones emerged with supercomputers enabling calculations of enormous perfect squares, such as those in series expansions for constants like π, where the Chudnovsky algorithm squared numbers with millions of digits to achieve record precisions by the 1990s.^[39] In the 21st century, perfect squares have found practical roles in elliptic curve cryptography, where determining whether a cubic polynomial value is a quadratic residue (i.e., a perfect square modulo a prime) is essential for finding points on elliptic curves over finite fields, underpinning secure protocols like ECDSA.^[40] However, no major new foundational theorems on perfect squares have emerged post-2000, with focus shifting to applications and computational efficiency.

References

[1]
[PDF] Applications of congruences and divisibility: elementary number ...
Perfect squares have some special properties. Prime divisors of perfect squares. If a = n2 is divisible by a prime p, then it must be divisible by p2. This ...
[2]
[PDF] Math 2150 Lecture 15 - UCCS Faculty Sites
... perfect square. Then by definition, n = m2 for some integer m. We consider cases determined by the ones digit of m. Page 89. Proof by Cases. We can now give a ...
[3]
Square Number -- from Wolfram MathWorld
A square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer.Missing: definition | Show results with:definition
[4]
Factoring by Difference of Perfect Squares - MathBitsNotebook(A1)
By definition, a perfect square is any number that is the square of a rational number, such as 0, 1, 4, 9, 16, . . . and such as 1/25, 16/81, . . . , etc ...
[5]
[PDF] Lemma. A positive integer n is a perfect square - CSUSM
A positive integer n is a perfect square if and only if every prime in its prime factorization occurs an even number of times. Example. Observe that 144 = 2432 ...
[6]
[PDF] A Note on Three Consecutive Powerful Numbers
Jan 17, 2025 · Lemma 1. The difference between any two perfect squares cannot be 2. Proof. One simply observes that (n + 1)2 − n2 = 2n + 1 > 2 when n ≥ 1, and.
[7]
[PDF] Exam 1 - UTK Math
But the squares modulo 4 are 0 and 1 only. [as 02 ≡ 0 (mod 4), 12 ≡ 1 (mod 4), 22 ≡ 0 (mod 4), and 32 ≡ 1 (mod 4)], so 1234567 is not a perfect square. 2.
[8]
A000290 - OEIS
### Summary of A000290 - Sequence of Squares
[9]
Area of a Square Formula - BYJU'S
Since all the sides are equal, the area would be length times width, which is equal to side × side. Hence, the area of a square is side square. Q3. What is the ...
[10]
[PDF] products of consecutives that are close to squares.
{1, 4, 9, 16,... } that two consecutive squares cannot differ by 1. How can one make this precise? Again algebra can be used: (n + 1)2 − n2 = 2n + 1 > 1.
[11]
[PDF] FERMAT'S CHRISTMAS THEOREM Contents 1. History 1 2. Proofs ...
Sep 23, 2023 · Originally formulated by Albert Girard in 1625, Fermat's theorem on the sum ... sum of two squares, either p ≡ 1 (mod 4) or p = 2. D. 2.2.Missing: source | Show results with:source
[12]
[PDF] Continued Fractions and Pell's Equation - UChicago Math
Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell's equation. I.Missing: fields | Show results with:fields
[13]
[PDF] On a Density for Sets of Integers - arXiv
Feb 9, 2015 · Thus, it follows from the preceding discussion that dens(A) = 0. Corollary 6 The density of the set of perfect squares is zero. Corollary 7 ...<|control11|><|separator|>
[14]
[PDF] pythagorean triples - keith conrad
Using the parametric formula for primitive Pythagorean triples, we can address questions concerning relations among the sides of a primitive right triangle.Missing: source | Show results with:source
[15]
[PDF] proofs by descent - keith conrad
Introduction. The method of descent is a technique developed by Fermat for proving certain equations have no (or few) integral solutions.
[16]
[PDF] Examples of Mordell's Equation - Keith Conrad
The equation y2 = x3 + k, for k ∈ Z, is called Mordell's equation1 due to Mordell's work on it throughout his life.Missing: source | Show results with:source
[17]
Chapter 26 The Equation y2 = x3 +k - ScienceDirect
This chapter presents a study of Diophantine equation, y 2 = x 3 + k. This equation has played a fundamental role in the development of number theory.Missing: y² = x³ +
[18]
Circle Lattice Points -- from Wolfram MathWorld
Schinzel's theorem shows that for every positive integer n, there exists a circle in the plane having exactly n lattice points on its circumference.Missing: distance perfect
[19]
Perfect Square Dissection -- from Wolfram MathWorld
A square which can be dissected into a number of smaller squares with no two equal is called a perfect square dissection (or a squared square).
[20]
Square Root Algorithm (GNU MP 6.3.0)
The square root of the high two parts is taken, by recursive application of the algorithm (bottoming out in a one-limb Newton's method),. s1,r1 = sqrtrem (a3 ...
[21]
Formal Verification of a State-of-the-Art Integer Square Root
We present the automatic formal verification of a state-of-the-art algorithm from the GMP library that computes the square root of a 64-bit integer.
[22]
Check if a given number is a Perfect square using Binary Search
Jul 12, 2025 · Binary search finds the mid, compares its square to the given number. If equal, return mid; otherwise, recursively check with adjusted start/ ...
[23]
What is complexity of checking whether a natural number is a perfect ...
Jan 17, 2015 · For a given number n, binary searching for the square root √n solves this problem in time O(logn).<|separator|>
[24]
Perfect Square Algorithm (GNU MP 6.3.0)
A significant fraction of non-squares can be quickly identified by checking whether the input is a quadratic residue modulo small integers.
[25]
6.5. Hashing — Problem Solving with Algorithms and Data Structures
One way to always have a perfect hash function is to increase the size of the hash table so that each possible value in the item range can be accommodated. This ...
[26]
Do perfect squares count as valid moduli for an RSA semi-prime?
Mar 11, 2021 · In addition to squares being trivial to factor, if you get p=q then the usual RSA formulas just don't work. RSA exponents e,d are chosen such ...RSA and prime difference - factoring - Cryptography Stack ExchangeIs it possible that two distinct RSA moduli share both of their prime ...More results from crypto.stackexchange.com
[27]
PERFECT Definition & Meaning - Dictionary.com
maths exactly divisible into equal integral or polynomial roots. 36 is a perfect square ... First recorded in 1250–1300; from Latin perfectus “finished ...
[28]
Square - Etymology, Origin & Meaning
Originating in mid-13c. Old French and Latin *exquadrare* ("to square"), square means a tool for right angles, four equal sides, and fairness or honesty.
[29]
Pythagoras's theorem in Babylonian mathematics
The Babylonians produced tables of squares, in fact their whole understanding of multiplication was built round squares, so perhaps a more obvious approach ...
[30]
Indian Sulbasutras - MacTutor History of Mathematics
The Sulbasutras are really construction manuals for geometric shapes such as squares, circles, rectangles, etc. and we illustrate this with some examples.Missing: perfect | Show results with:perfect
[31]
Book II - Euclid's Elements - Clark University
47. The last proposition II. 14 constructs a square equal to a given rectilinear figure thereby completeing the theory of areas begun in Book I.
[32]
Completing the Square: The prehistory of the quadratic formula
al-Khwarizmi works out a specific numerical example, which can serve as a template for any other equation of this form: "what must be the square which, when ...
[33]
[PDF] Learning algebra - Berkeley Mathematics
Oct 17, 2009 · From al-Khwarizmi (circa 780-850):. What must be the square which, when increased by 10 of its own roots, amounts to thirty-nine?<|separator|>
[34]
[PDF] Cardano and the Solution of the Cubic - Mathematics
In 1545, Cardano published his book Ars Magna, the “Great Art.” In it he published the solution to the depressed cubic, with a preface crediting del Ferro with ...
[35]
The Scandalous History of the Cubic Formula - Quanta Magazine
Jun 30, 2022 · Niccolò Fontana (left), also known as Tartaglia, and Gerolamo Cardano both played a role in solving cubic equations, but they became enemies ...
[36]
[PDF] Fermat's Theorem on Sums of Squares - Williams College
Theorem (Fermat) Let 𝑝 ∈ ℤ be an odd prime number. Then 𝑝 ≡ 1(𝑚𝑜𝑑 4) if and only if. 𝑝 = 𝑎2 + 𝑏2 for some 𝑎,𝑏 ∈ ℤ. Proof: ⇐ Assume that 𝑝 = 𝑎. 2 + 𝑏2.Missing: 1630s source<|separator|>
[37]
Euler and the Four-Squares Theorem - MathOverflow
Aug 31, 2010 · 15, 1747, Euler wrote: The theorem Any number can be split into four squares'' depends on this: Any number of the form 4m+2 can always be split ...Lagrange four-squares theorem --- deterministic complexityLagrange four-squares theorem: efficient algorithm with units ...More results from mathoverflow.netMissing: 1770 | Show results with:1770
[38]
proof of Lagrange's four-square theorem - PlanetMath
Mar 22, 2013 · The following proof is essentially Lagrange's original, from around 1770. First, we need three lemmas. Lemma 1. For any integers a,b,c,d,w,x,y,z.Missing: 1747 | Show results with:1747<|separator|>
[39]
254A, Notes 8: The Hardy-Littlewood circle method and ... - Terry Tao
Mar 30, 2015 · An incredibly useful tool for additive number theory, particularly when studying additive problems involving three or more variables taking values in sets such ...
[40]
The Chudnovsky Brothers and the Mountains of Pi | The New Yorker
Feb 24, 1992 · The world's most powerful supercomputers include the Cray Y-MP C90, the Thinking Machines CM-5, the Hitachi S-820/80, the nCube, the Fujitsu ...
[41]
Elliptic Curve Cryptography - UAF CS
Because not every x3 is a perfect square, some columns have no valid y values. On the very left, you can see the increasing values of the first few cubes ...