Improving solutions of ^k_i=11/x_i=1 with restrictions as required by Barbeau respectively by Johnson

DOI10.1016/J.DISC.2005.09.017MaRDI QIDQ2497481zbMATH OpenOpenAlexFDO

Authors Nechemia Burshtein

Publication date 4 August 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2005.09.017

zbMATH Keywords

examples for the solution of a Diophantine equation with Egyptian fractions with a non-divisibility condition

Mathematics Subject Classification ID

Rational numbers as sums of fractions (11D68) Computer solution of Diophantine equations (11Y50)

Review text

The author gives 63 integers \(x_i\), which are products of two primes, such that \(\sum^{63}_{i=0}\frac{1}{x_i} = 1\), and he gives 25 integers \(y_i\) of the form \(p^{\alpha} \cdot q^{\beta}\) satisfying \(\sum_{i}\frac{1}{y_i} = 1\). No indication is given how these integers were found.

Recommendations

• scientific article; zbMATH DE number 5896532
• On the number of solutions of \({\sum _{j=1}^ s}(1/x_ j)+1/(x_ 1{\cdots}x_ s)=1\)
• scientific article; zbMATH DE number 4091591
• scientific article; zbMATH DE number 1180478
• 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 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 3250697
• scientific article; zbMATH DE number 3078595
• scientific article; zbMATH DE number 4083711

Cites work

• On distinct unit fractions whose sum equals 1
• On distinct unit fractions whose sum equals 1

Cited in

(1)

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

This page was built for publication: Improving solutions of \(\sum^k_{i=1}1/x_i=1\) with restrictions as required by Barbeau respectively by Johnson

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497481)