Continued fraction BCMATH programs

  1. Euclid's algorithm and the continued fraction expansion of a rational number.
  2. The optimal continued fraction (OCF) expansion of a rational number.
  3. Nearest integer version of Euclid's algorithm.
  4. Guessing the simple continued fraction expansion of logba.
  5. Calculating the fraction represented by the simple continued fraction a0+1/a1+ ··· +1/an.
  6. Finding the simple continued fraction of a quadratic irrational.
  7. Finding the nearest integer continued fraction of a quadratic irrational (A. Hurwitz).
  8. Finding the nearest integer continued fraction of a quadratic irrational (half regular).
  9. Finding the optimal continued fraction of a quadratic irrational.
  10. Finding the nearest square continued fraction of a quadratic irrational.
  11. Finding period-length of the simple continued fraction of √d using midpoint criteria.
  12. Solving the Pell equation x2 - dy2 = ±1 by the nearest integer continued fraction method (NICF-P), using midpoint criteria.
  13. Solving the Pell equation x2 - dy2 = ±1 by the nearest square continued fraction method (NSCF), using midpoint criteria.
  14. Solving the diophantine equation x2 - xy - (D-1)y2/4 = ±1, using the nearest square continued fraction of (1+√D)/2, D ≡ 1(mod 4).
  15. Calculating the quadratic irrationality whose periodic simple continued fraction is given.
  16. Finding the simple continued fraction of the n-th root of a positive rational.
  17. Finding the simple continued fraction of the unique positive root of a trinomial axn+bx+c.
  18. Finding the simple continued fraction of the unique positive root of a trinomial axn+bxn-1+c.
  19. Finding the continued fraction of the unique positive root > 1 of a polynomial with integer coefficients.
  20. Finding a Sturm sequence for a squarefree polynomial.
  21. Factorising a non-negative unimodular matrix.
  22. Factorising a non-negative non-singular matrix.
  23. Finding the simple continued fraction of ep/q.
  24. Producing a quadratic surd equivalent to a given one.

Last modified 3th February 2010
Return to main page