Euclid, Fibonacci, and Pascal—recursed!

DOI10.1080/0020739750060402MaRDI QIDQ4093513zbMATH OpenOpenAlexFDO

Authors Howard A. Peelle

Publication date 1975

Published in International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020739750060402

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Recurrences (11B37) Binomial coefficients; factorials; (q)-identities (11B65) Software, source code, etc. for problems pertaining to number theory (11-04)

Recommendations

• scientific article; zbMATH DE number 910705
• “Curiouser and curiouser” said alice. further reflections on an interesting recursive function
• Recursion in computer science curriculum
• Recursion via Pascal
• Publication:4861390

Cited in

(1)

• User recursive functions in maxima

Describes a project that uses

Uses Software

• APL

This page was built for publication: Euclid, Fibonacci, and Pascal—recursed!

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