On solutions of _i = 1ⁿ¹/x_i=1 in integers of the form 2a k^b
Suppose \(a<3\) and \(b\) are nonnegative integers that can vary from term to term. Suppose \(k\) is a fixed positive integer that is not a power of \(2\).\N\NThe present research deals with solutions of the form \(2^ak^b\) for the following Diophantine equation: \N\[\N\sum^n _{i=1}{\frac{1}{x_i}}=1\text{ for }x_1\le x_2 \le \dots \le x_n. \N\]\NIn a survey of this paper, some attention is given to known results on solutions for partial cases and certain modifications of this Diophantine equation. Relations between the presented research and other investigations are noted.\N\NResults are presented with explanations, auxiliary schemes, proofs, and remarks. Also, an algorithm that produces solutions of the mentioned Diophantine equation, is described. The notion of a nontrivial solution is discussed, as well as the pairs \((k, n)\) for which this equation has a nontrivial solution, are characterized.
- All the solutions of the equation \(\sum ^{11}_{i=1} \frac{1}{x_i}= 1\) in distinct integers of the form \(x_i \in 3^{\alpha} 5^{\beta} 7^{\gamma}\)
- Chip-firing games and critical groups
- Double exponential lower bound for the number of representations of unity by Egyptian fractions
- Egyptian fractions with odd denominators
- Egyptian fractions with restrictions
- scientific article; zbMATH DE number 3675978 (Why is no real title available?)
- Improving solutions of \(\sum^k_{i=1}1/x_i=1\) with restrictions as required by Barbeau respectively by Johnson
- On Kellogg's diophantine problem.
- On the equation \(\displaystyle{\sum_{i=1}^n \frac{1}{x_i}=1} \) in distinct odd or even numbers
- On the number of solutions of \(\sum^{11}_{i=1}\frac {1}{x_i}=1\) in distinct odd natural numbers
- On the number of solutions of the Diophantine equation \(\sum_{i=1}^n\frac{1}{i}=1\)
- The equation \(\sum ^9_{i=1} \frac {1}{x_i} = 1\) in distinct odd integers has only the five known solutions
- The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions
- The number of representations of rationals as a sum of unit fractions
This page was built for publication: On solutions of \(\sum_{i = 1}^n1/x_i=1\) in integers of the form \(2^a k^b\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022019)
