Question

Positive integer solutions to $\frac{1}{a} + \frac{1}{b} = \frac{c}{d}$

score 221 · Answer 1 · 2020-07-24 21:05:13

221

Views

Positive integer solutions to $\frac{1}{a} + \frac{1}{b} = \frac{c}{d}$

Published on 24 Jul 2020 - 21:05

score 823 · Answer 2 · 2016-07-07 18:25:02

823

Views

Numbers whose reciprocals sum to $1$

Published on 07 Jul 2016 - 18:25

score 440 · Answer 3 · 2016-07-11 18:20:46

440

Views

Greedy algorithm Egyptian fractions for irrational numbers - patterns and irrationality proofs

Published on 11 Jul 2016 - 18:20

score 446 · Answer 4 · 2016-07-18 02:48:23

446

Views

How many egyptian fractions including and above (1/n) are necessary to sum to unity

Published on 18 Jul 2016 - 2:48

score 148 · Answer 5 · 2016-07-25 01:54:47

148

Views

Find all triples satisfying an equation

Published on 25 Jul 2016 - 1:54

score 286 · Answer 6 · 2016-08-28 22:51:52

286

Views

Surprising continued fractions of numbers in the form $\sum_{n=0}^\infty \frac{1}{a^{2^n}}$, including the same pattern for every $a>2$

Published on 28 Aug 2016 - 22:51

score 426 · Answer 7 · 2016-08-31 20:53:12

426

Views

Numbers $p-\sqrt{q}$ having regular egyptian fraction expansions?

Published on 31 Aug 2016 - 20:53

score 121 · Answer 8 · 2016-09-05 16:55:17

121

Views

Egyptian fractions inequality problem

Published on 05 Sep 2016 - 16:55

score 2.1k · Answer 9 · 2016-11-24 18:55:29

2.1k

Views

$\frac{1}{n}$ as a difference of Egyptian fractions with all denominators $<n$

Published on 24 Nov 2016 - 18:55

score 1.1k · Answer 10 · 2017-01-31 21:00:46

1.1k

Views

Expanding integers into distinct egyptian fractions - what is the optimal way?

Published on 31 Jan 2017 - 21:00

score 381 · Answer 11 · 2017-02-04 10:35:03

381

Views

Why does Engel expansion give smaller denominators than the Greedy algorithm?

Published on 04 Feb 2017 - 10:35

score 245 · Answer 12 · 2017-02-04 19:55:33

245

Views

Is this Egyptian fractions algorithm the same as the greedy algorithm? How to prove it?

Published on 04 Feb 2017 - 19:55

score 813 · Answer 13 · 2017-02-06 21:56:37

813

Views

Why this algorithm for egyptian fractions doesn't terminate in ~$2$% cases?

Published on 06 Feb 2017 - 21:56

score 342 · Answer 14 · 2017-03-27 18:50:13

342

Views

Represent improper fraction as a sum of unique unit fractions

Published on 27 Mar 2017 - 18:50

score 143 · Answer 15 · 2023-02-11 03:44:16

143

Views

Shortest palindromic Egyptian representation for reciprocal integers

Published on 11 Feb 2023 - 3:44

List Question

Positive integer solutions to $\frac{1}{a} + \frac{1}{b} = \frac{c}{d}$

Numbers whose reciprocals sum to $1$

Greedy algorithm Egyptian fractions for irrational numbers - patterns and irrationality proofs

How many egyptian fractions including and above (1/n) are necessary to sum to unity

Find all triples satisfying an equation

Surprising continued fractions of numbers in the form $\sum_{n=0}^\infty \frac{1}{a^{2^n}}$, including the same pattern for every $a>2$

Numbers $p-\sqrt{q}$ having regular egyptian fraction expansions?

Egyptian fractions inequality problem

$\frac{1}{n}$ as a difference of Egyptian fractions with all denominators $<n$

Expanding integers into distinct egyptian fractions - what is the optimal way?

Why does Engel expansion give smaller denominators than the Greedy algorithm?

Is this Egyptian fractions algorithm the same as the greedy algorithm? How to prove it?

Why this algorithm for egyptian fractions doesn't terminate in ~$2$% cases?

Represent improper fraction as a sum of unique unit fractions

Shortest palindromic Egyptian representation for reciprocal integers

Trending Questions

Popular # Hahtags

Popular Questions