/-
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 FormalConjecturesUtilNumber of integers $0 < k < n$ such that $k \phi(n - k) + 1$ is a square
Let $\phi$ denote Euler's totient function. The sequence $a(n)$ counts the integers $0 < k < n$ such that $k \phi(n - k) + 1$ is a square.
References:
@[expose] public sectionnamespace OeisA234246open ArithmeticFunctionopen scoped ArithmeticFunction.sigmaNumber of integers $0 < k < n$ such that $k \phi(n - k) + 1$ is a square, where $\phi$ is Euler's totient function.
def a (n : ℕ) : ℕ :=
∑ k ∈ Finset.Ico 1 n,
let m := k * (n - k).totient + 1
if ∃ r ≤ m, r * r = m then 1 else 0@[category test, AMS 11]
theorem a_1 : a 1 = 0 := ⊢ a 1 = 0 All goals completed! 🐙@[category test, AMS 11]
theorem a_2 : a 2 = 0 := ⊢ a 2 = 0 All goals completed! 🐙@[category test, AMS 11]
theorem a_3 : a 3 = 0 := ⊢ a 3 = 0 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_7 : a 7 = 2 := ⊢ a 7 = 2 All goals completed! 🐙Conjecture (i): $a(n) > 0$ if $n$ is not a divisor of $6$.
@[category research open, AMS 11]
theorem conjecture_1 (n : ℕ) (hn : 0 < n) (hd : ¬(n ∣ 6)) : 0 < a n := n:ℕhn:0 < nhd:¬n ∣ 6⊢ 0 < a n
All goals completed! 🐙Conjecture (i): The only values of $n$ with $a(n) = 1$ are $4, 5, 8, 9, 12, 13, 24, 33, 49$.
@[category research open, AMS 11]
theorem conjecture_2 (n : ℕ) :
a n = 1 ↔ n ∈ ({4, 5, 8, 9, 12, 13, 24, 33, 49} : Finset ℕ) := n:ℕ⊢ a n = 1 ↔ n ∈ {4, 5, 8, 9, 12, 13, 24, 33, 49}
All goals completed! 🐙Conjecture (ii): If $n \ge 60$, then $k + \phi(n - k)$ is a square for some $0 < k < n$.
@[category research open, AMS 11]
theorem conjecture_3 (n : ℕ) (hn : 60 ≤ n) :
∃ k, 0 < k ∧ k < n ∧ IsSquare (k + (n - k).totient) := n:ℕhn:60 ≤ n⊢ ∃ k, 0 < k ∧ k < n ∧ IsSquare (k + (n - k).totient)
All goals completed! 🐙Conjecture (ii): If $n > 60$, then $\sigma(k) + \phi(n - k)$ is a square for some $0 < k < n$, where $\sigma(k)$ is the sum of all positive divisors of $k$.
@[category research open, AMS 11]
theorem conjecture_4 (n : ℕ) (hn : 60 < n) :
∃ k, 0 < k ∧ k < n ∧ IsSquare (σ 1 k + (n - k).totient) := n:ℕhn:60 < n⊢ ∃ k, 0 < k ∧ k < n ∧ IsSquare ((σ 1) k + (n - k).totient)
All goals completed! 🐙Conjecture (iii): If $n > 7$ is not equal to $10$ or $20$, then $\phi(k)\phi(n - k) + 1$ is a square for some $0 < k < n$.
@[category research open, AMS 11]
theorem conjecture_5 (n : ℕ) (hn : 7 < n) (hne10 : n ≠ 10) (hne20 : n ≠ 20) :
∃ k, 0 < k ∧ k < n ∧ IsSquare (k.totient * (n - k).totient + 1) := n:ℕhn:7 < nhne10:n ≠ 10hne20:n ≠ 20⊢ ∃ k, 0 < k ∧ k < n ∧ IsSquare (k.totient * (n - k).totient + 1)
All goals completed! 🐙Conjecture (iv): If $n > 7$ is not equal to $10$ or $19$, then $(\phi(k) + \phi(n - k)) / 2$ is a triangular number for some $0 < k < n$.
@[category research open, AMS 11]
theorem conjecture_6 (n : ℕ) (hn : 7 < n) (hne10 : n ≠ 10) (hne19 : n ≠ 19) :
∃ k, 0 < k ∧ k < n ∧ ∃ m : ℕ, k.totient + (n - k).totient = m * (m + 1) := n:ℕhn:7 < nhne10:n ≠ 10hne19:n ≠ 19⊢ ∃ k, 0 < k ∧ k < n ∧ ∃ m, k.totient + (n - k).totient = m * (m + 1)
All goals completed! 🐙end OeisA234246