Terai's conjecture
TheoremThe Terai equation \((10m^2 + 1)^x + (15m^2 - 1)^y = (5m)^z\)#●ready to prove
MetaMathlibExt.terai_ten_fifteen_five_eq_one_one_two
For every integer \(m > 1\), the only solution of \((10m^2 + 1)^x + (15m^2 - 1)^y = (5m)^z\) in positive integers \(x, y, z\) is \((x, y, z) = (1, 1, 2)\).
public theorem_wanted terai_ten_fifteen_five_eq_one_one_two {m x y z : ℕ} (hm : 1 < m)
(hx : 0 < x) (hy : 0 < y) (hz : 0 < z)
(h : (10 * m ^ 2 + 1) ^ x + (15 * m ^ 2 - 1) ^ y = (5 * m) ^ z) :
x = 1 ∧ y = 1 ∧ z = 2
Sources
Sources
- Kalyan Chakraborty and Meenu Sharma, A Note on Terai's Conjecture Related to Exponential Diophantine Equations, INTEGERS 26 (2026), Article A67, Theorem 2.
TheoremHua's class number bound#●ready to prove
MetaMathlibExt.gaussClassNumber_neg_four_mul_lt
For every positive integer \(D\), the Gauss class number \(h(-4D)\), the number of primitive, reduced, positive definite binary quadratic forms of discriminant \(-4D\), satisfies \(h(-4D) < \frac{4}{\pi} \sqrt{D} \log(2e\sqrt{D})\), where \(\log\) is the natural logarithm.
The source quotes this bound from Hua's textbook for the class number of positive binary quadratic forms; it is read here as the primitive (Gauss) class number.
public theorem_wanted gaussClassNumber_neg_four_mul_lt (D : ℕ) (hD : 0 < D) :
(gaussClassNumber (-4 * D) : ℝ) <
4 / Real.pi * Real.sqrt D * Real.log (2 * Real.exp 1 * Real.sqrt D)
public def gaussClassNumber (d : ℤ) : ℕ :=
((reducedFormsOfDiscriminant d).filter fun q =>
Int.gcd (Int.gcd q.1 q.2.1 : ℤ) q.2.2 = 1).card
WantedExt/NumberTheory/QuadraticForms/KroneckerFormSumsWanted.lean:56
Sources
Sources
- Kalyan Chakraborty and Meenu Sharma, A Note on Terai's Conjecture Related to Exponential Diophantine Equations, INTEGERS 26 (2026), Article A67, Theorem 3.
Uses 1
Statement usesGauss class number of a discriminant
2 ready to prove
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.