/-
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 FormalConjecturesUtilErdős Problem 1053
References:
[Gu04] Guy, Richard K., Unsolved problems in number theory. Springer-Verlag, New York (2004).
@[expose] public sectionopen ArithmeticFunction Filteropen scoped ArithmeticFunction.sigmanamespace Erdos1053Call a number $k$-perfect if $\sigma(n)=kn$, where $\sigma(n)$ is the sum of the divisors of $n$. Must $k=o(\log\log n)$?
A question of Erdős, as reported in problem B2 of Guy's collection [Gu04]. The little-$o$ relation is taken as $n \to \infty$ within the positive integers for which $\sigma(n) = kn$ for some $k$; on this set, $\sigma(n)/n$ is precisely that multiplier $k$.
@[category research open, question, AMS 11]
theorem erdos_1053 :
(fun n : ℕ ↦ (σ 1 n : ℝ) / (n : ℝ)) =o[atTop ⊓ 𝓟 {n : ℕ | ∃ k, Nat.IsPerfectFor n 1 k}]
(fun n : ℕ ↦ Real.log (Real.log (n : ℝ))) := ⊢ (fun n ↦ ↑((σ 1) n) / ↑n) =o[atTop ⊓ 𝓟 {n | ∃ k, n.IsPerfectFor 1 k}] fun n ↦ Real.log (Real.log ↑n)
All goals completed! 🐙Guy further writes 'It has even been suggested that there may be only finitely many $k$-perfect numbers with $k\geq 3$.'
@[category research open, AMS 11]
theorem erdos_1053.variants.guy :
∀ k ≥ 3, {n : ℕ | Nat.IsPerfectFor n 1 k}.Finite := ⊢ ∀ k ≥ 3, {n | n.IsPerfectFor 1 k}.Finite
All goals completed! 🐙end Erdos1053