/-
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 FormalConjecturesUtilLargest smallest-base in a decomposition of $n$ into at most four squares
The sequence $a(n)$ is the largest integer $k$ such that $n = k^2 + \dots$ is a decomposition of $n$ into a sum of at most four nondecreasing squares: $$a(n) = \max {k \ge 1 : \exists b_1, b_2, b_3 \in {0} \cup [k, n], k^2 + b_1^2 + b_2^2 + b_3^2 = n}$$
References:
@[expose] public sectionnamespace OeisA241898open FinsetPredicate testing whether $k$ is the smallest base in a decomposition of $n$ into a sum of at most four squares.
def isValidBase (n k : ℕ) : Bool :=
let S := 0 :: List.range' k (n - k + 1)
0 < k && S.any fun b1 => S.any fun b2 => S.any fun b3 =>
k ^ 2 + b1 ^ 2 + b2 ^ 2 + b3 ^ 2 == nLargest integer $k$ such that $n = k^2 + \dots$ is a decomposition of $n$ into a sum of at most four nondecreasing squares.
def a (n : ℕ) : ℕ :=
((Icc 1 n).filter (fun k => isValidBase n k)).max.getD 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 = 1 := ⊢ a 2 = 1
All goals completed! 🐙@[category test, AMS 11]
theorem a_3 : a 3 = 1 := ⊢ a 3 = 1
All goals completed! 🐙@[category test, AMS 11]
theorem a_4 : a 4 = 2 := ⊢ a 4 = 2
All goals completed! 🐙@[category test, AMS 11]
theorem a_5 : a 5 = 1 := ⊢ a 5 = 1
All goals completed! 🐙"From the data that I have, it would seem that $a(n)$ is greater than $7$ for all $n > 599$."
David S. Newman, May 02 2014
This is false: since every four-square decomposition of a multiple of $8$ uses only even squares, $a(4m) = 2a(m)$ for all even $m \ge 2$. From $a(46) = 1$ (via $46 = 1^2 + 3^2 + 6^2$) we obtain $a(184) = 2$ and $a(736) = a(16 \cdot 46) = 4 \le 7$.
@[category research solved, AMS 11]
theorem conjecture_1 : ¬ ∀ n : ℕ, 599 < n → 7 < a n := ⊢ ¬∀ (n : ℕ), 599 < n → 7 < OeisA241898.a n
All goals completed! 🐙"By Lagrange's Theorem every number can be written as a sum of four squares. Can the same be said of the set of ${a^2 \mid a \text{ is any integer not equal to } 7}$? If this could be proved, it would only remain to check if all the numbers up to $599$ can be written as the sum of $4$ squares none of which is $7^2$."
David S. Newman, May 02 2014
Note that $0 \in \mathbb{N} \setminus {7}$ allows representations as a sum of at most four positive squares none of which is $7^2$.
@[category research open, question, AMS 11]
theorem conjecture_2 :
∀ n : ℕ, ∃ a b c d : ℕ,
a ≠ 7 ∧ b ≠ 7 ∧ c ≠ 7 ∧ d ≠ 7 ∧ a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = n := ⊢ ∀ (n : ℕ), ∃ a b c d, a ≠ 7 ∧ b ≠ 7 ∧ c ≠ 7 ∧ d ≠ 7 ∧ a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2 = n
All goals completed! 🐙end OeisA241898