On the Frobenius number of a proportionally modular Diophantine inequality (Q2642794)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Frobenius number of a proportionally modular Diophantine inequality |
scientific article |
Statements
On the Frobenius number of a proportionally modular Diophantine inequality (English)
0 references
5 September 2007
0 references
A proportionally modular Diophantine inequality is \(ax\pmod b\leq cx\), where \(a,b,c\) are positive integers. An algorithm is given to compute the greatest integer \(x\) that is not a solution of such an inequality and in some cases a formula for that number is obtained.
0 references
Frobenius number
0 references
