/- Copyright 2026 The Formal Conjectures Authors. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. -/ module public import FormalConjecturesUtil

Refining Lagrange's four-square theorem with $(5x^2 + 7y^2 + 9z^2)yz$ a square

Number of ordered ways to write $n$ as $x^2 + y^2 + z^2 + w^2$ with $(5x^2 + 7y^2 + 9z^2)yz$ a square, where $x, y, z, w$ are nonnegative integers with $z > 0$.

References:

@[expose] public sectionnamespace OeisA261876

Whether a natural number $k$ is a perfect square.

def isSquare (k : ℕ) : Bool := Nat.sqrt k ^ 2 == k

Number of ordered ways to write $n$ as $x^2 + y^2 + z^2 + w^2$ with $(5x^2 + 7y^2 + 9z^2)yz$ a square, where $x, y, z, w$ are nonnegative integers with $z > 0$.

def a (n : ℕ) : ℕ := ∑ x ∈ Finset.range (n + 1), ∑ y ∈ Finset.range (n + 1), ∑ z ∈ Finset.Ico 1 (n + 1), ∑ w ∈ Finset.range (n + 1), if x ^ 2 + y ^ 2 + z ^ 2 + w ^ 2 == n && isSquare ((5 * x ^ 2 + 7 * y ^ 2 + 9 * z ^ 2) * y * z) then 1 else 0@[category test, AMS 11] theorem a_1 : a 1 = 1 := ⊢ a 1 = 1 All goals completed! 🐙@[category test, AMS 11] theorem a_2 : a 2 = 3 := ⊢ a 2 = 3 All goals completed! 🐙@[category test, AMS 11] theorem a_3 : a 3 = 2 := ⊢ a 3 = 2 All goals completed! 🐙@[category test, AMS 11] theorem a_4 : a 4 = 1 := ⊢ a 4 = 1 All goals completed! 🐙@[category test, AMS 11] theorem a_5 : a 5 = 4 := ⊢ a 5 = 4 All goals completed! 🐙

The set of base integers $m$ for which $a(n) = 1$ when $n = 4^k m$.

def specialSet : Finset ℕ := {1, 7, 23, 647, 863}

Conjecture (i): $a(n) > 0$ for all $n > 0$.

@[category research open, AMS 11] theorem conjecture_1 (n : ℕ) (hn : 0 < n) : 0 < a n := n:ℕhn:0 < n⊢ 0 < a n All goals completed! 🐙

Conjecture (i): $a(n) = 1$ only for $n = 4^k m$ ($k = 0, 1, 2, \dots$ and $m \in {1, 7, 23, 647, 863}$).

Disproved in arXiv:2608.11941 at $n = 69383$, where $(x, y, z, w) = (187, 147, 6, 113)$ is the unique representation, so $a(69383) = 1$.

@[category research solved, AMS 11] theorem conjecture_2 : ¬ ∀ n : ℕ, (a n = 1 ↔ ∃ k : ℕ, ∃ m ∈ specialSet, n = 4 ^ k * m) := ⊢ ¬∀ (n : ℕ), a n = 1 ↔ ∃ k, ∃ m ∈ specialSet, n = 4 ^ k * m All goals completed! 🐙

The set of coefficient triples $(c_1, c_2, c_3)$ for part (ii) of the conjecture.

def triples : Finset (ℕ × ℕ × ℕ) := {(1, 8, 20), (3, 5, 15), (6, 14, 4), (7, 29, 5), (18, 38, 18), (39, 81, 51), (42, 98, 14)}

Conjecture (ii): For each triple $(c_1, c_2, c_3) \in {(1,8,20), (3,5,15), (6,14,4), (7,29,5), (18,38,18), (39,81,51), (42,98,14)}$, any natural number can be written as $x^2 + y^2 + z^2 + w^2$ with $x, y, z, w$ nonnegative integers such that $xy(c_1 x^2 + c_2 y^2 + c_3 z^2)$ is a square.

@[category research open, AMS 11] theorem conjecture_3 (t : ℕ × ℕ × ℕ) (ht : t ∈ triples) (n : ℕ) : ∃ x y z w : ℕ, n = x ^ 2 + y ^ 2 + z ^ 2 + w ^ 2 ∧ IsSquare (x * y * (t.1 * x ^ 2 + t.2.1 * y ^ 2 + t.2.2 * z ^ 2)) := t:ℕ × ℕ × ℕht:t ∈ triplesn:ℕ⊢ ∃ x y z w, n = x ^ 2 + y ^ 2 + z ^ 2 + w ^ 2 ∧ IsSquare (x * y * (t.1 * x ^ 2 + t.2.1 * y ^ 2 + t.2.2 * z ^ 2)) All goals completed! 🐙end OeisA261876