On a property of the division algorithm and its application to the theory of non-unique factorizations (Q1045951)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a property of the division algorithm and its application to the theory of non-unique factorizations |
scientific article; zbMATH DE number 5650382
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a property of the division algorithm and its application to the theory of non-unique factorizations |
scientific article; zbMATH DE number 5650382 |
Statements
On a property of the division algorithm and its application to the theory of non-unique factorizations (English)
0 references
18 December 2009
0 references
For \(1<a<n\) write \(n=qa+r\) with \(0\leq r<n\) and put \(\sigma_{n,a}=q+r\). The authors show that for \(n\geq3\) this function takes all integer values in the interval \([2,(n+1)/2]\) and determines the cases when it assumes the maximal value.
0 references
Euclidean algorithm
0 references
