arXiv · 1312.5126
On the least positive solution to a proportionally modular Diophantine inequality
Abstract
Given three positive integers $a,b,c$, a proportionally modular Diophantine inequality is an expression of the form $ax \mod{b} \le cx$. Our aim is to give a recursive formula for the least solution to such an inequality. We then use the formula to derive an algorithm. Finally, we apply our results to a question of Rosales and Garc\'ia-S\'anchez.
Explore related subjects
Keep this discovery
Alessio Moscariello. 2013-12-18. On the least positive solution to a proportionally modular Diophantine inequality. https://arxiv.org/abs/1312.5126
Cite the original work for its findings. Save a collection to share your selection of sources.