The Greedy Algorithm seems a standard way of computing egyptian fractions, but I can't find any proof that it always halts nor I can prove it.
Is there any algorithm for egyptian fractions that necessarily halts (is always finite)?
The Greedy Algorithm seems a standard way of computing egyptian fractions, but I can't find any proof that it always halts nor I can prove it.
Is there any algorithm for egyptian fractions that necessarily halts (is always finite)?
Copyright © 2021 JogjaFile Inc.