/-
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 FormalConjecturesUtilSmallest deficient multiplier for non-deficiency
For $n \ge 2$, $a(n)$ is the smallest deficient number $k$ such that the product $k \cdot n$ is non-deficient (i.e., perfect or abundant).
References:
@[expose] public sectionnamespace OeisA215926Smallest deficient number $k$ such that $k \cdot n$ is non-deficient (perfect or abundant).
noncomputable def a (n : ℕ) : ℕ :=
sInf {k : ℕ | k.Deficient ∧ ((k * n).Perfect ∨ (k * n).Abundant)}@[category test, AMS 11]
theorem a_2 : a 2 = 3 :=
IsLeast.csInf_eq (⊢ IsLeast {k | k.Deficient ∧ ((k * 2).Perfect ∨ (k * 2).Abundant)} 3 All goals completed! 🐙)@[category test, AMS 11]
theorem a_3 : a 3 = 2 :=
IsLeast.csInf_eq (⊢ IsLeast {k | k.Deficient ∧ ((k * 3).Perfect ∨ (k * 3).Abundant)} 2 All goals completed! 🐙)@[category test, AMS 11]
theorem a_4 : a 4 = 3 :=
IsLeast.csInf_eq (⊢ IsLeast {k | k.Deficient ∧ ((k * 4).Perfect ∨ (k * 4).Abundant)} 3 All goals completed! 🐙)@[category test, AMS 11]
theorem a_5 : a 5 = 4 :=
IsLeast.csInf_eq (⊢ IsLeast {k | k.Deficient ∧ ((k * 5).Perfect ∨ (k * 5).Abundant)} 4 All goals completed! 🐙)@[category test, AMS 11]
theorem a_6 : a 6 = 1 :=
IsLeast.csInf_eq (⊢ IsLeast {k | k.Deficient ∧ ((k * 6).Perfect ∨ (k * 6).Abundant)} 1 All goals completed! 🐙)The smallest prime strictly greater than $2^m$ (A014210).
noncomputable def nextPrimeTwoPow (m : ℕ) : ℕ :=
sInf {p : ℕ | 2 ^ m < p ∧ p.Prime}Conjecture: For every $n \ge 2$, $a(n)$ is $1$, $3$, or a power of $2$.
@[category research open, AMS 11]
theorem conjecture_1 (n : ℕ) (hn : 2 ≤ n) :
a n = 1 ∨ a n = 3 ∨ (a n).isPowerOfTwo := n:ℕhn:2 ≤ n⊢ a n = 1 ∨ a n = 3 ∨ (a n).isPowerOfTwo
All goals completed! 🐙Conjecture: The first occurrence of $2^m$ happens at A014210$(m)$.
We require $m \ge 1$ because for $m = 0$, the first occurrence of $2^0 = 1$ is at $n = 6$, whereas $\mathrm{A014210}(0) = 2$ gives $a(2) = 3$.
@[category research open, AMS 11]
theorem conjecture_2 (m : ℕ) (hm : 1 ≤ m) :
IsLeast {n : ℕ | 2 ≤ n ∧ a n = 2 ^ m} (nextPrimeTwoPow m) := m:ℕhm:1 ≤ m⊢ IsLeast {n | 2 ≤ n ∧ a n = 2 ^ m} (nextPrimeTwoPow m)
All goals completed! 🐙end OeisA215926