Efficient algorithm for linear diophantine equations in two variables
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916872598847488 |
|---|---|
| author | Deora, Mayank Pal, Pinakpani |
| author_facet | Deora, Mayank Pal, Pinakpani |
| contents | Solving linear diophantine equations in two variables have applications in computer science and mathematics. In this paper, we revisit an algorithm for solving linear diophantine equations in two variables, which we refer as DEA-R algorithm. The DEA-R algorithm always incurs equal or less number of recursions or recursive calls as compared to extended euclidean algorithm. With the objective of taking advantage of the less number of recursive calls , we propose an optimized version of the DEA-R algorithm as DEA-OPTD. In the recursive function calls in DEA-OPTD, we propose a sequence of more efficient computations. We do a theoretical comparison of the execution times of DEA-OPTD algorithm and DEA-R algorithm to find any possible bound on the value of $c$ for DEA-OPTD being better than DEA-R. We implement and compare an iterative version of DEA-OPTD (DEA-OPTDI) with two versions of a widely used algorithm on an specific input setting. In this comparison, we find out that our algorithm outperforms on the other algorithm against atleast 96% of the inputs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_23216 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient algorithm for linear diophantine equations in two variables Deora, Mayank Pal, Pinakpani Data Structures and Algorithms Solving linear diophantine equations in two variables have applications in computer science and mathematics. In this paper, we revisit an algorithm for solving linear diophantine equations in two variables, which we refer as DEA-R algorithm. The DEA-R algorithm always incurs equal or less number of recursions or recursive calls as compared to extended euclidean algorithm. With the objective of taking advantage of the less number of recursive calls , we propose an optimized version of the DEA-R algorithm as DEA-OPTD. In the recursive function calls in DEA-OPTD, we propose a sequence of more efficient computations. We do a theoretical comparison of the execution times of DEA-OPTD algorithm and DEA-R algorithm to find any possible bound on the value of $c$ for DEA-OPTD being better than DEA-R. We implement and compare an iterative version of DEA-OPTD (DEA-OPTDI) with two versions of a widely used algorithm on an specific input setting. In this comparison, we find out that our algorithm outperforms on the other algorithm against atleast 96% of the inputs. |
| title | Efficient algorithm for linear diophantine equations in two variables |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2507.23216 |