On sums of Egyptian fractions
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912141730119680 |
|---|---|
| author | Silberger, Donald |
| author_facet | Silberger, Donald |
| contents | Let $n,d$, and $k$ be positive integers where $n$ and $d$ are coprime. Our two main results are
Theorem 1. There is a partition of the infinite interval $[kd,\infty)$ of positive integers into a family of finite sets $X$ for which the sum of the reciprocals of the elements in $X$ is $n/d$.
Theorem 1. There is a partition of $[2kd,\infty)$ into an infinite family of infinite sets $Y$ for which the sum of the reciprocals of the elements in $Y$ is $n/d$.
Our method is grounded in the Vital Identity, $1/z = 1/(z+1) + 1/z(z+1)$, which holds for every complex number $z \notin \{-1,0\}$, and which gives rise to an eponymous algorithm that serves as our tool. At the core of our Theorems 1 and 2 is the number theoretic function $\star: x\mapsto \star x := x(x+1)$ into whose properties this paper continues an investigation initiated in [7]. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_02049 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On sums of Egyptian fractions Silberger, Donald Number Theory 2020 MSC 01A55, 01A60, 11A25, 11N05, 11N25 2020 Let $n,d$, and $k$ be positive integers where $n$ and $d$ are coprime. Our two main results are Theorem 1. There is a partition of the infinite interval $[kd,\infty)$ of positive integers into a family of finite sets $X$ for which the sum of the reciprocals of the elements in $X$ is $n/d$. Theorem 1. There is a partition of $[2kd,\infty)$ into an infinite family of infinite sets $Y$ for which the sum of the reciprocals of the elements in $Y$ is $n/d$. Our method is grounded in the Vital Identity, $1/z = 1/(z+1) + 1/z(z+1)$, which holds for every complex number $z \notin \{-1,0\}$, and which gives rise to an eponymous algorithm that serves as our tool. At the core of our Theorems 1 and 2 is the number theoretic function $\star: x\mapsto \star x := x(x+1)$ into whose properties this paper continues an investigation initiated in [7]. |
| title | On sums of Egyptian fractions |
| topic | Number Theory 2020 MSC 01A55, 01A60, 11A25, 11N05, 11N25 2020 |
| url | https://arxiv.org/abs/2412.02049 |