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 identity): For and , we have Let Switching the terms and we find that Shifting the indices we find Now these functional equations with , we get Therefore In fact apply the functional relations again to get, Therefore has no poles. We have Writing we , and using the functional equation we […]
Quintic Equations:
Bring-Jerrard Quintic Equations: Any general quintic can be reduced to Bring-Jerrard form using the Tschirnhaus type transformations: 1. Using the shifts , we can remove the term. 2. It’s also possible to remove the term if we use the substitution and choose so that satisfies Details: where We can make by these equations which give […]
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
Cardano’s formula: Given Use shifts to eliminate the term. doesn’t have term if Therefore The equation reduces to the depressed cubic Substitute The equation becomes We want such that solve the quadratic equation To get all the roots, once has to choose the cube roots properly. The two choices of cube roots used above have […]
Kürschâk and Nagel’s theorems (Erdos 1932)
None of the above quantities are integers. Proof: For the first expression, look at the largest prime- when we clear denominators, the denominator is divisible by this prime and numerator is not.For the second expression, if the is smaller then then the quantity is less than one, otherwise there will be a prime between $m$ […]
Betrand Postulate : Erdos( 1932)
The theorem, known as Bertrand’s Postulate, asserts that for any integer , there is always a prime number satisfying . Erdős’s proof (1932) is centered on a careful analysis of the prime factors of the central binomial coefficient, . Contradiction Hypothesis: Assume there exists an integer for which no prime p exists in the interval […]
Zeta(2)
Basel Problem 1644 asks to find the value of Euler (1735) showed that The result, , is a cornerstone of analysis, and there are diverse methods of proof from function theory, harmonic analysis, and geometry. All of them essentially uncover how integers sit inside real numbers. Euler’s Proof: Euler’s original method relies on two representations […]
Eisenstein’s Lattice Point Proof of Quadratic Reciprocity
The Law of Quadratic Reciprocity is a cornerstone of classical number theory—Gauss himself called it the “Theorema Aureum” (Golden Theorem). Although Gauss provided multiple proofs, Eisenstein’s geometric argument simplifies Gauss’s third proof by employing a lattice‐point counting method. Statement of the Law of Quadratic Reciprocity Let and be distinct odd primes. The Law of Quadratic […]