Sourav Mandal

Mr. Sourav Mandal


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2025 in Resonance
Verified
Journal Article
Closed access
PDF file
SMSourav Mandal
Sourav Mandal
Sagar MandalSagar Mandal
Sagar Mandal

1 January 2025 in Annals of West University of Timisoara - Mathematics and Computer Science
Verified
Journal Article
Open access
PDF file
TCTapas Chatterjee
Tapas Chatterjee
Sagar MandalSagar Mandal
Sagar Mandal
SMSourav Mandal
Sourav Mandal
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 · m 2 , 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}}} .