Digging for roots using the Pascal spade

DOI10.1017/S0025557200004496zbMath1383.11028OpenAlexW2412459436MaRDI QIDQ5277945

S. Shirali

Publication date: 12 July 2017

Published in: The Mathematical Gazette (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0025557200004496

zbMATH Keywords

binomial coefficientsspeed of convergencesimple continued fractionsprimitive roots of unitypower sequencesapproximating higher roots of integersPascal maprecursively defined sequences

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Other combinatorial number theory (11B75) Continued fractions (11A55) Special sequences and polynomials (11B83)

Cites Work

• Unnamed Item
• Unnamed Item
• Ladder Approximations of Irrational Numbers
• An Iterative Method for Approximating Square Roots
• Square Roots by an Iterative Method and Its Generalization to Positive Integral Roots of Order n

This page was built for publication: Digging for roots using the Pascal spade