F Borges, P Lara, R Portugal - Applied Mathematics and Computation, 2017 - Elsevier
Modular exponentiation is a time-consuming operation widely used in cryptography. Modular multi-exponentiation, a generalization of modular exponentiation also used in …
H Liu, J Yue - Applied Mathematics and Computation, 2022 - Elsevier
Assume non-zero real numbers κ 1,…, κ 6 are not all negative. Assume also κ 1 κ 2 is algebraic and not rational, the sequence G is well-spaced and ϑ> 0. In this work, we showed …
In this study, the positive solutions of the Diophantine equation D: x2−(σ2+ 4) y2−(2σ− 2) x−(2σ4+ 8σ2) y− σ6− 4σ4+ σ2− 2σ− 3= 0 on the set Z are investigated, along with some …
In this paper, we show that the Diophantine equation ax²-bx= cy² in positive integers x, y, a, b, c has infinitely many solutions where ac is not a square. We transform the above equation …