enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Lentz's algorithm - Wikipedia

    en.wikipedia.org/wiki/Lentz's_algorithm

    The idea was introduced in 1973 by William J. Lentz [1] and was simplified by him in 1982. [4] Lentz suggested that calculating ratios of spherical Bessel functions of complex arguments can be difficult. He developed a new continued fraction technique for calculating the ratios of spherical Bessel functions of consecutive order.

  3. Continued fraction - Wikipedia

    en.wikipedia.org/wiki/Continued_fraction

    The same ⁠ 1 / μ ⁠ = 3 + √ 8 (the silver ratio squared) also is observed in the unfolded general continued fractions of both the natural logarithm of 2 and the n th root of 2 (which works for any integer n > 1) if calculated using 2 = 1 + 1.

  4. Periodic continued fraction - Wikipedia

    en.wikipedia.org/wiki/Periodic_continued_fraction

    By considering the complete quotients of periodic continued fractions, Euler was able to prove that if x is a regular periodic continued fraction, then x is a quadratic irrational number. The proof is straightforward. From the fraction itself, one can construct the quadratic equation with integral coefficients that x must satisfy.

  5. Greedy algorithm for Egyptian fractions - Wikipedia

    en.wikipedia.org/wiki/Greedy_algorithm_for...

    Every fraction2 / y ⁠ requires two terms in its greedy expansion if and only if y ≡ 1 (mod 2); the simplest such fraction is ⁠ 2 / 3 ⁠. A fraction3 / y ⁠ requires three terms in its greedy expansion if and only if y ≡ 1 (mod 6), for then −y mod x = 2 and ⁠ y(y + 2) / 3 ⁠ is odd, so the fraction remaining after a ...

  6. Summation by parts - Wikipedia

    en.wikipedia.org/wiki/Summation_by_parts

    [2] Summation by parts is frequently used to prove Abel's theorem and Dirichlet's test . One can also use this technique to prove Abel's test : If ∑ n b n {\textstyle \sum _{n}b_{n}} is a convergent series , and a n {\displaystyle a_{n}} a bounded monotone sequence , then S N = ∑ n = 0 N a n b n {\textstyle S_{N}=\sum _{n=0}^{N}a_{n}b_{n ...

  7. Egyptian fraction - Wikipedia

    en.wikipedia.org/wiki/Egyptian_fraction

    For instance, the primary pseudoperfect number 1806 is the product of the prime numbers 2, 3, 7, and 43, and gives rise to the Egyptian fraction 1 = ⁠ 1 / 2 ⁠ + ⁠ 1 / 3 ⁠ + ⁠ 1 / 7 ⁠ + ⁠ 1 / 43 ⁠ + ⁠ 1 / 1806 ⁠.

  8. Partial fraction decomposition - Wikipedia

    en.wikipedia.org/wiki/Partial_fraction_decomposition

    In algebra, the partial fraction decomposition or partial fraction expansion of a rational fraction (that is, a fraction such that the numerator and the denominator are both polynomials) is an operation that consists of expressing the fraction as a sum of a polynomial (possibly zero) and one or several fractions with a simpler denominator.

  9. Integration by reduction formulae - Wikipedia

    en.wikipedia.org/wiki/Integration_by_reduction...

    To compute the integral, we set n to its value and use the reduction formula to express it in terms of the (n – 1) or (n – 2) integral. The lower index integral can be used to calculate the higher index ones; the process is continued repeatedly until we reach a point where the function to be integrated can be computed, usually when its index is 0 or 1.