EgyptianFractionsTriangle (org.matheclipse:matheclipse-gpl 3.0.0 API)

java.lang.Object
- de.tilman_neumann.jml.base.BigIntTriangle
- - de.tilman_neumann.jml.EgyptianFractionsTriangle

```
public class EgyptianFractionsTriangle
extends BigIntTriangle
```
Computes the number of terms/steps the Greedy algorithm requires to find a sum of simple quotients for any k/n; 0

Author:

Tilman Neumann

- Constructor Summary
  
  Constructors
  Constructor Description
  
  EgyptianFractionsTriangle(int n)
- Method Summary
  
  All Methods Static Methods Concrete Methods
  Modifier and Type Method Description
  
  static void main(String[] args)
  - Methods inherited from class de.tilman_neumann.jml.base.BigIntTriangle
    addRow, get, getRow, getRowSum, getRowSums, set, toList, toString
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

EgyptianFractionsTriangle

public EgyptianFractionsTriangle(int n)

Method Detail

main

public static void main(String[] args)