Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 4006333

From MaRDI portal
Publication:3757962
Jump to:navigation, search

zbMATH Open0621.10008MaRDI QIDQ3757962FDOQ3757962


Authors: M. E. Mays Edit this on Wikidata


Publication date: 1987



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



Recommendations

  • scientific article
  • scientific article; zbMATH DE number 3961705
  • New binary Euclidean algorithms
  • scientific article; zbMATH DE number 3581610
  • An Iterative Euclidean Algorithm


zbMATH Keywords

Euclidean algorithmdivision algorithmBASIC


Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)



Cited In (5)

  • Divide-and-permute
  • A division algorithm without number comparison
  • New bounds on the length of finite pierce and Engel series
  • A DIVISION ALGORITHM
  • What Happens When the Division Algorithm “Almost” Works





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 Q3757962)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3757962&oldid=17292333"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 11:43. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki