Digging for roots using the Pascal spade

DOI10.1017/S0025557200004496MaRDI QIDQ5277945zbMATH OpenOpenAlexFDO

Authors 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

approximating higher roots of integersbinomial coefficientsPascal mappower sequencesprimitive roots of unityrecursively defined sequencessimple continued fractionsspeed of convergence

Mathematics Subject Classification ID

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

Recommendations

• Soil Searching by an Artificial Root
• A new family of root-finders
• The root extraction problem
• A Rapid Robust Rootfinder
• scientific article; zbMATH DE number 1504478
• Raising the Roots
• EXTRACTION OF ROOTS IN GARSIDE GROUPS
• The roots of trees
• Self-planting: digging holes in rough landscapes

Cites work

• An Iterative Method for Approximating Square Roots
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 638125 (Why is no real title available?)
• Ladder Approximations of Irrational Numbers
• Square Roots by an Iterative Method and Its Generalization to Positive Integral Roots of Order n

Cited in

(1)

• Cyclic surprises

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277945)