Class EgyptianFractionsTriangle

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
  • Constructor Summary

    Constructors
    Constructor Description
    EgyptianFractionsTriangle​(int n)  
  • Method Summary

    Modifier and Type Method Description
    static void main​(java.lang.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 Details

    • EgyptianFractionsTriangle

      public EgyptianFractionsTriangle​(int n)
  • Method Details

    • main

      public static void main​(java.lang.String[] args)