On solutions of \(\sum_{i = 1}^n1/x_i=1\) in integers of the form \(2^a k^b\) (Q7022019)

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.