/-
Copyright 2025 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(m,k)-perfect numbers
A positive integer $n$ is $(m,k)$-perfect if $\sigma^m(n)=kn$, where $\sigma^m$ is the $m$-th iterate of the sum-of-divisors function.
References:
@[expose] public sectionopen ArithmeticFunction.sigmanamespace SuperperfectThe perfect number $6$ is $(1,2)$-perfect.
@[category test, AMS 11]
theorem six_is_one_two_perfect : Nat.IsPerfectFor 6 1 2 := ⊢ Nat.IsPerfectFor 6 1 2
⊢ 0 < 6 ∧ (fun x ↦ (σ 1) x)^[1] 6 = 2 * 6
All goals completed! 🐙There does not exist a $(2,5)$-perfect number
@[category research open, AMS 11]
theorem twoFivePerfect : ¬ ∃ n, Nat.IsPerfectFor n 2 5 := ⊢ ¬∃ n, n.IsPerfectFor 2 5
All goals completed! 🐙end Superperfect