Definition:Heap Problem

From ProofWiki
Jump to navigation Jump to search

Definition

A heap problem is one where:

an unknown $x$ is established
$x$ is expressed as the sum of one or more fractions of $x$ and one or more other whole number.

The object is to find $x$.


Also known as

In the Rhind Papyrus such problems were called aha problems.

In the Middle Ages, problems of this form were often called God greet you problems, as they were usually couched in the form of a bunch of strangers meeting on the road.


Also see

  • Results about heap problems can be found here.


Historical Note

Heap problems can be found dating from as long ago as in the Rhind Papyrus.

The Epitaph of Diophantus is a similar problem.

It was a popular type of problem in Ancient Greece.


Sources