Three integers whose sum, product and the sum of the products of the integers, taken two at a time, are perfect squares
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910967510597632 |
|---|---|
| author | Choudhry, Ajai |
| author_facet | Choudhry, Ajai |
| contents | Euler had considered the problem of finding three integers whose sum, product, and also the sum of the products of the integers, taken two at a time, are all perfect squares. Euler's methods of solving the problem lead to parametric solutions in terms of polynomials of high degrees and his numerical solutions consisted of very large integers. We obtain, by a new method, several parametric solutions given by polynomials of much smaller degrees and thus we get a number of numerically small solutions of the problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_19088 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Three integers whose sum, product and the sum of the products of the integers, taken two at a time, are perfect squares Choudhry, Ajai Number Theory 11D25 Euler had considered the problem of finding three integers whose sum, product, and also the sum of the products of the integers, taken two at a time, are all perfect squares. Euler's methods of solving the problem lead to parametric solutions in terms of polynomials of high degrees and his numerical solutions consisted of very large integers. We obtain, by a new method, several parametric solutions given by polynomials of much smaller degrees and thus we get a number of numerically small solutions of the problem. |
| title | Three integers whose sum, product and the sum of the products of the integers, taken two at a time, are perfect squares |
| topic | Number Theory 11D25 |
| url | https://arxiv.org/abs/2505.19088 |