code: public double backwardNaive(int n, double... args)
      {
          double term = getA(n, args)/getB(n,args);
          
          for(n = n-1; n >0; n--)
          {
              term = getA(n, args)/(getB(n,args)+term);
          }
          
          return term + getB(0, args);
      }
docs: Approximates the continued fraction using a naive approximation
  
  @param n the number of iterations to perform
  @param args the values to input for the variables of the continued fraction
  @return an approximation of the value of the continued fraciton