Question

Sufficiently large integers can be partitioned into squares of distinct integers whose reciprocals sum to 1.

score 826 · Answer 1 · 2026-02-22 21:52:27

826

Views

Sufficiently large integers can be partitioned into squares of distinct integers whose reciprocals sum to 1.

Published on 22 Feb 2026 - 21:52

score 166 · Answer 2 · 2018-04-02 20:15:16

166

Views

Is there a close form for $g(a,b,n)=\sum\limits_{k=0}^{n}\binom{n}{k}\frac{1}{ak+b}$?

Published on 02 Apr 2018 - 20:15

score 570 · Answer 3 · 2018-07-20 09:34:14

570

Views

Egyptian fractions with very large denominators

Published on 20 Jul 2018 - 9:34

score 118 · Answer 4 · 2018-07-27 00:42:14

118

Views

Number of ways to sum two Egyptian fractions and satisfy a given inequality.

Published on 27 Jul 2018 - 0:42

score 432 · Answer 5 · 2018-09-04 22:41:29

432

Views

Show Sylvester sequence is the smallest solution with n terms to sum of unit fractions equalling 1

Published on 04 Sep 2018 - 22:41

score 251 · Answer 6 · 2018-11-06 22:50:32

251

Views

Egyptian fractions: does the greedy algorithm never give more fractions than absolutely necessary?

Published on 06 Nov 2018 - 22:50

score 105 · Answer 7 · 2018-11-25 21:57:26

105

Views

Permutations, products, and unit fractions

Published on 25 Nov 2018 - 21:57

score 345 · Answer 8 · 2018-12-24 15:01:44

345

Views

Egyptian Fraction when numerator is greater than denominator

Published on 24 Dec 2018 - 15:01

score 315 · Answer 9 · 2019-01-07 02:01:57

315

Views

Product of sum of reciprocals

Published on 07 Jan 2019 - 2:01

score 994 · Answer 10 · 2019-04-12 08:04:17

994

Views

Sum of reciprocals of odd numbers that add up to 1

Published on 12 Apr 2019 - 8:04

score 122 · Answer 11 · 2019-04-12 23:32:47

122

Views

Representing positive integers with Egyptian fractions as short as possible

Published on 12 Apr 2019 - 23:32

score 34 · Answer 12 · 2019-05-02 01:27:06

34

Views

Egyptian fractions of the form `2/n` with smallest sum of denominators

Published on 02 May 2019 - 1:27

score 196 · Answer 13 · 2019-05-17 18:43:06

196

Views

Algorithm expressing a fraction as a sum of unit fractions

Published on 17 May 2019 - 18:43

score 143 · Answer 14 · 2019-05-28 22:31:39

143

Views

Sum of reciprocals of finite odd numbers that add up to 1

Published on 28 May 2019 - 22:31

score 86 · Answer 15 · 2019-05-29 13:18:54

86

Views

Are there any algorithms for regular Egyptian fractions?

Published on 29 May 2019 - 13:18

List Question

Sufficiently large integers can be partitioned into squares of distinct integers whose reciprocals sum to 1.

Is there a close form for $g(a,b,n)=\sum\limits_{k=0}^{n}\binom{n}{k}\frac{1}{ak+b}$?

Egyptian fractions with very large denominators

Number of ways to sum two Egyptian fractions and satisfy a given inequality.

Show Sylvester sequence is the smallest solution with n terms to sum of unit fractions equalling 1

Egyptian fractions: does the greedy algorithm never give more fractions than absolutely necessary?

Permutations, products, and unit fractions

Egyptian Fraction when numerator is greater than denominator

Product of sum of reciprocals

Sum of reciprocals of odd numbers that add up to 1

Representing positive integers with Egyptian fractions as short as possible

Egyptian fractions of the form `2/n` with smallest sum of denominators

Algorithm expressing a fraction as a sum of unit fractions

Sum of reciprocals of finite odd numbers that add up to 1

Are there any algorithms for regular Egyptian fractions?

Trending Questions

Popular # Hahtags

Popular Questions