We present a proof of Jacobi’s formula for representation number for sums of two squares due to Michael D. Hirschhorn Start with the Jacobi’s Triple Product identity Plugging for then for multiply by and we obtain Differentiating with and plugging we get, Divide by which equals to get We also have Therefore we established Plugging […]
Category: $
Pell’s equation
Let be a positive non-square integer.Consider the Pell equation Let If solves the equation , so does In fact, we see that there is a single which generates all the possible solutions this way. Theorem: (Minimal solution generates all the solutions) If is the minimal element of with and then every element with if of […]
Triple Product Identity, Gauss
Here is a proof of the Jacobi’s Triple Product Identity due to Gauss: Consider Notice that Thus by repeated application of the above identity, we get And so we proved the identity Dividing this identity by where (Assume is even) and substituting , we get Taking , we get the triple product identity
Jacobi Triple Product Identity
Jacobi’s triple product is one of the basic identities in the theory of theta functions and -series. It converts a bilateral theta series, indexed by all integers, into an infinite product. In the form we shall use, it say: For and , we have The identity is powerful because the two sides look as though […]
Quintic Equations
To understand how to solve the general quintic equation, one must first reconsider what it means to “solve” an equation at all. Consider the familiar analytic formulation of an ordinary radical: This formula says that an ordinary radical is produced in two stages. First, integrate the elementary differential Second, apply the exponential function. The Hermite–Kronecker–Brioschi […]
Irrationality of Zeta(3) (Beuker’s Proof)
We want to prove irrationality of This is the only odd positive integer which is known to be irrational. First proof of irrationality was by Apery who used constructed some very good rational approximations to zeta(3) using some recurrence relations. This proof has a lot of connections to hypergeometric functions, modular forms and many interesting […]
Irrationality of Zeta(3) using Modular Forms
The proof is based on the following lemma. Let be power series in Suppose that for any , the -th coefficient in the Taylor series of is rational and has denominator dividing where , are certain fixed positive integers and is the lowest common multiple of Suppose there exist real numbers such that has radius […]
Apery’s Proof of Irrationality of Zeta(3)
We want to prove the irrationality of . We will use the following remarkable formula to achieve that. In fact, we will prove that for any rational , we have The strategy to prove irrationality is simple. If you can approximate the number to well by rationals, then the number has to be irrational. Precisely […]
Erdős and Niven (1942)- Integrality of Harmonic Sums
THEOREM: There is only a finite number of integers for which oneor more of the elementary symmetric functions of is an integer. Proof: For small enough (), the k-th elementary symmetric function of the is less than For larger use existence of primes in short intervals to find a prime in the interval then and […]
Pi is irrational
Assume that Consider Note that are both integers. (Small derivatives at 0 vanish and larger derivatives cancel the denominators from the coefficients coming after taking derivatives. And then use symmetry of f for ) But Contradiction!
p-adic valuation of Harmonic sums
Look at the p adic-valuation of Harmonic sums. For 2-valuation the denominator contains a power of 2 which equals the highest power of 2 less than When you take common denominators and compute the numerator- you see that all terms except this power of 2 will gives even contributions and this terms gives an odd […]
List of Quadratic Reciprocity Proofs
http://www.rzuser.uni-heidelberg.de/~hb3/fchrono.html Many proofs of quadratic reciprocity are presented here. Theorema Fundamentale in Doctrina de Residuis Quadraticis. Gauss has proof by induction by reducing the problem of computing to Legendre symbol for a particular pair of primes to smaller numbers. Being a residue is captured by an equation, but what about non-residue? Gauss ingenious idea is […]
BBP Formula for Pi
This formula due to Bailey-Borwein-Plouffe is discovered by using integer relation algorithm PSLQ. They searched for integer relations between the quantities , and found the above relation. Finding the relation is the harder part, proving it is easy. Proof: Therefore, We get Similar formula for Quest for Pi: https://www.davidhbailey.com//dhbpapers/pi-quest.pdf PSLQ Algorithm: https://www.davidhbailey.com/dhbpapers/pslq-comp-alg.pdfBBP Formula: https://www.experimentalmath.info/bbp-codes/bbp-alg.pdf
Ramanujan Formula for Pi, WZ method
This can be seen as specialization of the following identity at Proof: We provide a proof by WZ method. We want to find such that If we have such a , then we have and we can see that will be a constant. Choice found by algorithms: Now So we are done. https://arxiv.org/pdf/math/9306213.pdf
Pi (approximations, formulae)
Pi: Polygon Approximations: Using perimeters of inscribed and circumscribed polygons: Let be the perimeters of regular sided polygon inscribed, circumscribed. We have Archimedes used 96 sided polygon to get: Leibniz formula: An accelerated series can be obtained by Euler transform: Nilakanta Series: Madhava: Machin’s formula: Proof: By using we get Essentially equivalent to the identity […]
Cubic Equations
The cubic formula is less mysterious if one does not begin by trying to guess a root. Instead, one changes variables until the cubic has a form in which its nonlinear part can be split into two pieces. The key point is that all of Cardano’s formula, Viète’s substitution, the trigonometric solution, and Lagrange resolvents […]
Kürschâk and Nagel’s theorems (Erdos 1932)
Consider the familiar reciprocal sums None of the above quantities are integers.The first, second, and fourth cases all follow from one very elementary principle. One looks for a prime which occurs in one denominator more strongly than it occurs in every other denominator. After the fractions are put over a common denominator, every term except […]
Betrand Postulate : Erdos( 1932)
Bertrand’s postulate states that for every integer , there is a prime satisfying The statement is elementary, but it is remarkably strong: no matter how far one goes along the number line, one never encounters a multiplicative gap as large as a factor of containing no primes. Erdős’s proof (1932) of this fact is centered […]
Hölder’s inequality is repeated Cauchy–Schwarz
Cauchy–Schwarz and Hölder’s inequality are the basic tools for controlling the interaction, or correlation, of two functions. For finite sequences and , their correlation is measured by the inner product The triangle inequality reduces the problem to estimating Thus the central question is this: how can one control the total interaction using only separate information […]
Zeta(2)
Basel Problem (1644) asks to find the exact value of the series Euler (1735) showed that At first glance, this is a problem about a list of numbers. Yet its answer, contains , a constant associated with circles, periodicity, and geometry. The surprise is not merely that the sum has a closed form. It is […]
Eisenstein’s Lattice Point Proof of Quadratic Reciprocity
The Law of Quadratic Reciprocity is one of the central results of classical number theory. Gauss famously called it the “Theorema Aureum,” or Golden Theorem. It reveals a hidden symmetry between two different modular worlds. At first glance, the question “Is a square modulo ?” seems unrelated to the question “Is a square modulo ?” […]