Open Access
Research Article·pp. 505–513·Vol. 29, Issue 2-AFeb 2026
Analysis of discrete algorithms using the Diophantine equations for efficient problem solving
Amit Garg, Kirti Bikram, Kumari Shipra, Ambuj Kumar Agarwal, P. Aravind, Ginni Nijhawan
Published Online: 07 Feb 2026DOI: 10.47974/JDMSC-2490
In this paper: This paper looks at how Diophantine equations can be used to analyze and improve discrete algorithms so that they can solve problems more quickly. Finding integer answers to polynomial equations using...
