Disproofs of two conjectures concerning nondeficient numbers

Abstract

A positive integer n is said to be nondeficient if σ(n) ≥ 2n. Letting the positive divisors of a positive integer n be written as 1 = d0 < d1 < ·s < dk < dk+1 = n, and letting S denote a set of integers, if there exist values λj ∈ S such that 1 + Σj=1k λj dj = n, then n is said to be an S-perfect number. Ross, in 2024, introduced the study of S-perfect numbers, and concluded with two conjectures that each concern both \ -1, 1 \-perfect numbers and nondeficient numbers. We disprove both of these conjectures.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…