An Egyptian algorithm for polynomials

MaRDI QIDQ801112zbMATH OpenFDO

Authors David E. Dobbs, Robert M. McConnel

Publication date 1984

Published in Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/141345

zbMATH Keywords

Egyptian algorithmintegral domainrational functions

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Polynomials in number theory (11C08)

Review text

Let R be an integral domain with quotient field K. An analogue is developed for rational functions in one indeterminate over K to the so- called Egyptian algorithm implying that in (0,1) every rational number \(a/b=1/k_ 1+...+1/k_ m\) for some positive integers \(k_ 1<...<k_ m\).

Recommendations

• scientific article; zbMATH DE number 1946912
• scientific article; zbMATH DE number 2149236
• The splitting algorithm for Egyptian fractions
• scientific article; zbMATH DE number 1296286
• Algorithmic polynomials
• Algorithmic Polynomials
• An Algorithm for Solving Polynomial Equations
• scientific article; zbMATH DE number 4132307
• scientific article; zbMATH DE number 850292

Cited in

(4)

• Ahmes expansions of formal Laurent series and a class of nonarchimedean integral domains
• scientific article; zbMATH DE number 1946912 (Why is no real title available?)
• Rings that are Egyptian with respect to a multiplicative set
• Egyptian integral domains

This page was built for publication: An Egyptian algorithm for polynomials

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