An Egyptian algorithm for polynomials (Q801112)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3877300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Egyptian algorithm for polynomials |
scientific article; zbMATH DE number 3877300 |
Statements
An Egyptian algorithm for polynomials (English)
0 references
1984
0 references
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\).
0 references
integral domain
0 references
rational functions
0 references
Egyptian algorithm
0 references
0.8494024
0 references
0.8252378
0 references
