2000 character limit reached
On a problem of De Koninck
Published 24 Jun 2019 in math.NT and math.CO | (1906.10001v3)
Abstract: Let $\sigma(n)$ and $\gamma(n)$ denote the sum of divisors and the product of distinct prime divisors of $n$ respectively. We shall show that, if $n\neq 1, 1782$ and $\sigma(n)=(\gamma(n))2$, then there exist odd (not necessarily distinct) primes $p, p\prime$ and (not necessarily odd) distinct primes $q_i (i=1, 2, \ldots, k)$ such that $p, p\prime\mid\mid n$, $q_i2\mid\mid n (i=1, 2, \ldots, k)$ and $q_1\mid \sigma(p2), q_{i+1}\mid\sigma(q_i2) (1\leq i\leq k-1), p\prime \mid\sigma(q_k2)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.