A Polynomial Diophantine Generator Function for Integer Residuals
Charles Sauerbier
TL;DR
This paper introduces two Diophantine equation generator functions designed to produce integer residuals from integer division over specific closed intervals, expanding tools for number theory and computational mathematics.
Contribution
It presents novel generator functions for Diophantine equations tailored to particular integer intervals, enhancing methods for generating integer residuals.
Findings
Two generator functions successfully produce integer residuals over specified intervals
The functions are applicable to number theory and computational mathematics tasks
Potential for further exploration in Diophantine equation generation
Abstract
Two Diophantine equation generator function for integer residuals produced by integer division over closed intervals are presented. One each for the closed intervals [1,Floor(n^0.5)] and [Ceiling(n^0.5),n], respectively.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Polynomial and algebraic computation · Chaos-based Image/Signal Encryption