Does 20 have a friend? Or is it a solitary number? A folklore conjecture asserts that 20 has no friends, i.e., it is a solitary number. In this article, we prove that a friend N of 20 is of the form N = 2 · 5
2
a · m2 , with (3 ;m ) = (7 ;m ) = 1 and it has at least six distinct prime divisors. Furthermore, we show that Ω ( N ) ≥ 2 ω ( N ) + 6 a − 5 and if Ω ( m ) ≤ K then N < 10 · 6 (2 K
−2
a
+3
−1)2 , where Ω( n ) and ω ( n ) denote the total number of prime divisors and the number of distinct prime divisors of the integer n respectively. In addition, we deduce that not all exponents of odd prime divisors of friend N of 20 are congruent to −1 modulo f , where f is the order of 5 in (ℤ /p ℤ) × such that 3 | f and p is a prime congruent to 1 modulo 6. Also, we prove necessary upper bounds for all prime divisors of friends of 20 in terms of the number of divisors of the friend. In addition, we prove that if P is the largest prime divisor of N , then P < N 1 4 P < {N^{{1 \over 4}}} .
1 January 2025 in Journal of Educational Studies in Mathematics and Computer Science
We provide two simple and visual geometric proofs of the 𝜋 𝑒 < 𝑒 𝜋. These proofs are based on comparing areas under exponential curves and basic geometric shapes. Our approach builds on earlier visual arguments but introduces new geometric constructions that make the result more accessible for students and teachers. By highlighting these relationships visually, we hope to encourage further exploration and pedagogical use of similar inequalities involving transcendental numbers.
16 June 2025 in Notes on Number Theory and Discrete Mathematics
In a recent paper [7], the authors introduced new arithmetic functions $\varphi^+$, $\sigma^+$ related to the classical functions $\varphi$, and $\sigma$, respectively. In this note, we study the behavior of $$\sum_{\substack{n\leq x\\ \omega(n)=2}}(\varphi^{+}-\varphi)(n),~~~\text{and}~~\sum_{\substack{n\leq x\\ \omega(n)=2}}(\sigma^{+}-\sigma)(n),$$ for any real number $x\geq 6$.
We investigate the relationship between the sizes of the sum and difference sets of the Dicyclic Group $\mathrm{Dic}_{4n}$. We first determine the exact numbers of MSTD (more sums than differences), MDTS (more differences than sums), and balanced subsets of size two. As a consequence, we show that the numbers of MSTD and balanced subsets of size two are asymptotically equal as $n \to \infty$. For odd $n$, we then obtain exact counts of MSTD, MDTS, and balanced subsets of size three, with the results depending on whether $n$ is divisible by $3$. In this case, we establish that asymptotically the number of MSTD subsets of size three is six times the number of MDTS subsets and also six times the number of balanced subsets. Finally, we establish a lower bound for the number of MSTD, MDTS, and balanced subsets of $\mathrm{Dic}_{4n}$ corresponding to the boundary case of size $2n$.
9 December 2025 in Notes on Number Theory and Discrete Mathematics
Inspired by Lehmer’s and Deaconescu’s conjectures, as well as various analogue problems concerning Euler’s totient function ϕ(n), Schemmel’s totient function S_2(n), Jordan totient function J_k, and the unitary totient function ϕ^{*}(n), we investigate analogous divisibility problems involving the functions σ(n), σ^{+}(n), and ϕ^{+}(n). Further, we establish some interesting properties of the sequences {σ^+(n)}_{n=1}^∞ and ${ϕ^+(n)}_{n=1}^∞, in particular, we prove that each of these sequences contains infinitely many arithmetic progressions of length 3.