Finding all S-Diophantine quadruples for a fixed set of primes S
2021
Given a finite set of primes S and an m-tuple $$(a_1,\ldots ,a_m)$$
of positive, distinct integers we call the m-tuple S-Diophantine, if for each $$1\le i < j\le m$$
the quantity $$a_ia_j+1$$
has prime divisors coming only from the set S. For a given set S we give a practical algorithm to find all S-Diophantine quadruples, provided that $$|S|=3$$
.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
17
References
0
Citations
NaN
KQI