On certain rational perfect numbers, II
نویسندگان
چکیده
We continue the study from [1], by studying equations of type $\psi(n) = \dfrac{k+1}{k} \cdot \ n+a,$ $a\in \{0, 1, 2, 3\},$ and $\varphi(n) \dfrac{k-1}{k} n-a,$ 3\}$ for $k > 1,$ where $\psi(n)$ $\varphi(n)$ denote Dedekind, respectively Euler's, arithmetical functions.
منابع مشابه
On Perfect Totient Numbers
Let n > 2 be a positive integer and let φ denote Euler’s totient function. Define φ(n) = φ(n) and φ(n) = φ(φ(n)) for all integers k ≥ 2. Define the arithmetic function S by S(n) = φ(n) + φ(n) + · · ·+ φ(n) + 1, where φ(n) = 2. We say n is a perfect totient number if S(n) = n. We give a list of known perfect totient numbers, and we give sufficient conditions for the existence of further perfect ...
متن کاملOn Perfect and Near-perfect Numbers
We call n a near-perfect number if n is the sum of all of its proper divisors, except for one of them, which we term the redundant divisor. For example, the representation 12 = 1 + 2 + 3 + 6 shows that 12 is near-perfect with redundant divisor 4. Near-perfect numbers are thus a very special class of pseudoperfect numbers, as defined by Sierpiński. We discuss some rules for generating near-perfe...
متن کاملOn Certain Coxeter Lattices Without Perfect Sections
In this paper, we compute the kissing numbers of the sections of the Coxeter lattices A n+1 2 n , n odd, and in particular we prove that for n ≥ 7 they cannot be perfect. The proof is merely combinatorial and relies on the structure of graphs canonically attached to the sections.
متن کاملOn perfect numbers which are ratios of two Fibonacci numbers ∗
Here, we prove that there is no perfect number of the form Fmn/Fm, where Fk is the kth Fibonacci number.
متن کاملOn the Nonexistence of Odd Perfect Numbers
In this article, we show how to prove that an odd perfect number with eight distinct prime factors is divisible by 5. A perfect number N is equal to twice the sum of its divisors: σ(N) = 2N . The theory of perfect numbers when N is even is well known: Euclid proved that if 2 − 1 is prime, then 2p−1(2p − 1) is perfect, and Euler proved that every one is of this type. These numbers have seen a gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notes on Number Theory and Discrete Mathematics
سال: 2022
ISSN: ['1310-5132', '2367-8275']
DOI: https://doi.org/10.7546/nntdm.2022.28.3.525-532