scientific article; zbMATH DE number 3341178

zbMATH Open0215.06704MaRDI QIDQ5617662

David E. Daykin

Publication date: 1970

Full work available at URL: http://www.fq.math.ca/Scanned/8-4/daykin.pdf

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On primitive recursive algorithms and the greatest common divisor function 👍 👎
• Generating the greatest common divisor, and limitations of primitive recursive algorithms 👍 👎
• Algorithms for the approximate common divisor problem 👍 👎
• A modular integer GCD algorithm 👍 👎
• A Greatest Common Divisor Algorithm 👍 👎

This page was built for publication:

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