A note on necessary conditions for a friend of 10
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909458047696896 |
|---|---|
| author | Chatterjee, Tapas Mandal, Sagar Mandal, Sourav |
| author_facet | Chatterjee, Tapas Mandal, Sagar Mandal, Sourav |
| contents | Solitary numbers are shrouded with mystery. A folklore conjecture assert that 10 is a solitary number i.e. it has no friends. In this article, we establish that if $N$ is a friend of $10$ then it must be odd square with at least seven distinct prime factors, with $5$ being the least one. Moreover there exists a prime factor $p$ of $N$ such that $2a+1\equiv 0 \pmod f$ and $5^{f}\equiv 1 \pmod p$ where $f$ is the smallest odd positive integer greater than $1$ and less than or equal to $\min\{ 2a+1,p-1\}$, provided $5^{2a}\mid \mid N$. Further, there exist prime factors $p$ and $q$ (not necessarily distinct) of $N$ such that $p\equiv1 \pmod {10}$ and $q\equiv 1\pmod 6$. Besides, we prove that if a Fermat prime $F_k$ divides $N$ then $N$ must have a prime factor congruent to $1$ modulo $2F_k$. Also, if we consider the form of $N$ as $N=5^{2a}m^2$ then $m$ is non square-free. Furthermore, we show that $Ω(N)\geq 2ω(N)+6a-4$ and if $Ω(m)\leq K$ then $N< 5\cdot 6^{(2^{K-2a+1}-1)^2}$ where $Ω(n)$ and $ω(n)$ denote the total number of prime factors and the number of distinct prime factors of the integer $n$ respectively. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_00624 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A note on necessary conditions for a friend of 10 Chatterjee, Tapas Mandal, Sagar Mandal, Sourav Number Theory 11Axx, 11A25 Solitary numbers are shrouded with mystery. A folklore conjecture assert that 10 is a solitary number i.e. it has no friends. In this article, we establish that if $N$ is a friend of $10$ then it must be odd square with at least seven distinct prime factors, with $5$ being the least one. Moreover there exists a prime factor $p$ of $N$ such that $2a+1\equiv 0 \pmod f$ and $5^{f}\equiv 1 \pmod p$ where $f$ is the smallest odd positive integer greater than $1$ and less than or equal to $\min\{ 2a+1,p-1\}$, provided $5^{2a}\mid \mid N$. Further, there exist prime factors $p$ and $q$ (not necessarily distinct) of $N$ such that $p\equiv1 \pmod {10}$ and $q\equiv 1\pmod 6$. Besides, we prove that if a Fermat prime $F_k$ divides $N$ then $N$ must have a prime factor congruent to $1$ modulo $2F_k$. Also, if we consider the form of $N$ as $N=5^{2a}m^2$ then $m$ is non square-free. Furthermore, we show that $Ω(N)\geq 2ω(N)+6a-4$ and if $Ω(m)\leq K$ then $N< 5\cdot 6^{(2^{K-2a+1}-1)^2}$ where $Ω(n)$ and $ω(n)$ denote the total number of prime factors and the number of distinct prime factors of the integer $n$ respectively. |
| title | A note on necessary conditions for a friend of 10 |
| topic | Number Theory 11Axx, 11A25 |
| url | https://arxiv.org/abs/2404.00624 |