On partitions into squares of distinct integers whose reciprocals sum to 1

01/18/2018
by   Max A. Alekseyev, et al.
0

In 1963, Graham proved that all integers greater than 77 (but not 77 itself) can be partitioned into distinct positive integers whose reciprocals sum to 1. He further conjectured that for any sufficiently large integer, it can be partitioned into squares of distinct positive integers whose reciprocals sum to 1. In this study, we establish the exact bound for existence of such representations by proving that 8542 is the largest integer with no such partition.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/30/2017

Sum of squares lower bounds from symmetry and a good story

In this paper, we develop machinery for proving sum of squares lower bou...
research
08/14/2021

Evaluating the sum of positive series

We provide numerical procedures for possibly best evaluating the sum of ...
research
08/29/2023

When Can You Tile an Integer Rectangle with Integer Squares?

This paper characterizes when an m × n rectangle, where m and n are inte...
research
02/06/2020

The Sum Composition Problem

In this paper, we study the "sum composition problem" between two lists ...
research
06/29/2020

Partitioned Least Squares

In this paper we propose a variant of the linear least squares model all...
research
11/16/2021

Solving sums of squares in global fields

The problem of writing a totally positive element as a sum of squares ha...
research
03/20/2019

Identifying Maximal Non-Redundant Integer Cone Generators

A non-redundant integer cone generator (NICG) of dimension d is a set S ...

Please sign up or login with your details

Forgot password? Click here to reset