On the number of solutions of _j=1^ s(1/x_ j)+1/(x_ 1x_ s)=1
The authors study the diophantine equation \[ \sum_{j=1}^ s {1\over {x_ j}}+ {1\over {\prod_{j=1}^ s x_ j}}=1, \qquad 1<x_ 1<\dots< x_ s, \] which has been investigated since 1881 by \textit{J. J. Sylvester} [Am. J. Math. 3, 322-336, 388-390 (1881; JFM 13.0142.02)]. Besides the pure number theory reasons there are motivations from topology, graph theory, group theory, and the area of singularities of algebraic surfaces. \textit{J. Janák} and \textit{L. Skula} [Math. Slovaca 28, 305-310 (1978; Zbl 0418.10001)] published the list of all solutions for \(s\leq 6\) and 18 solutions for \(s=7\). \textit{Z. Cao}, \textit{R. Liu} and \textit{L. Zhang} [J. Number Theory 27, 206-211 (1987; Zbl 0621.10013)] found 5 additional solutions for \(s=7\), and this list was completed by \textit{L. Brenton} and \textit{R. Hill} [Pac. J. Math. 133, 41-67 (1988; Zbl 0616.14032)] to the total of 26 solutions. In the paper of \textit{L. Brenton} and \textit{R. Bruner} [J. Aust. Math. Soc. (to appear)] 42 new solutions of length 8 were otained using the following statement: ``if \(x_ 1,\dots,x_ s\) is a solution of length \(s\), then \(x_ 1,\dots,x_ s\), \(x_ 1\dots x_ s+P\), \(x_ 1\dots x_ s+Q\) is a solution of length \(s+2\) for all factorizations \(PQ\) of \((x_ 1\dots x_ s)^ 2+1\). The main result of this paper is given by the presentation of 205 solutions for \(s=9\). The authors use the former statement for factorizations \((x_ 1\dots x_ 7)^ 2+1\), where \(x_ 1,\dots,x_ 7\) are known solutions of length 7. These factorizations are mentioned in Table I.
- scientific article; zbMATH DE number 798962
- scientific article; zbMATH DE number 4091591
- On the solutions of equation \(\sum\limits^s_{i=1}\dfrac1{x_i}+\dfrac1{x_1\cdots x_s}=1\) and the number of solutions of Znám's problem
- scientific article; zbMATH DE number 943404
- On the number of solutions of the Diophantine equation \(\sum_{i=1}^n\frac{1}{i}=1\)
- scientific article; zbMATH DE number 3415938
- On the equation \(\sum ^{s}_{j=1}(1/x_ j)+(1/(x_ 1\,\dots \,x_ s))=1\) and Znám's problem
- On the number of solutions of \(\sum^{11}_{i=1}\frac {1}{x_i}=1\) in distinct odd natural numbers
- scientific article; zbMATH DE number 1180478
- scientific article; zbMATH DE number 5896532
- On the equation \(\sum ^{s}_{j=1}(1/x_ j)+(1/(x_ 1\,\dots \,x_ s))=1\) and Znám's problem
- On the diophantine equation \(1=\sum \frac{1}{n_ i}+\frac{1}{\prod n_ i}\quad and\) a class of homologically trivial complex surface singularities
- The equation \(\sum ^9_{i=1} \frac {1}{x_i} = 1\) in distinct odd integers has only the five known solutions
- Improving solutions of \(\sum^k_{i=1}1/x_i=1\) with restrictions as required by Barbeau respectively by Johnson
- On solving
- On the solutions of equation \(\sum\limits^s_{i=1}\dfrac1{x_i}+\dfrac1{x_1\cdots x_s}=1\) and the number of solutions of Znám's problem
- scientific article; zbMATH DE number 4091591 (Why is no real title available?)
- scientific article; zbMATH DE number 1180478 (Why is no real title available?)
- On the equation $\sum_{p|N}\frac1p+\frac1N = 1$, pseudoperfect numbers, and perfectly weighted graphs
- NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs
- Critical groups of arithmetical structures on star graphs and complete graphs
This page was built for publication: On the number of solutions of \({\sum _{j=1}^ s}(1/x_ j)+1/(x_ 1{\cdots}x_ s)=1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801577)
