Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\) (Q1692331)

Connecting to and generalizing several results from the literature, the authors prove that under certain conditions all solutions of the equation in the title can be effectively bounded. Here \(u_n,u_m\) are terms of a binary linear recurrence sequence of positive discriminant, and \(p_1,\dots,p_s\) are distinct primes. In their proofs, beside other things, the authors make use of Baker's method, which is applied with a skillful technique. Based upon their method, the authors provide an elegant and rather efficient algorithm for the solution of the title equation in concrete cases. To illustrate how the algorithm works, all solutions of the equation is given when \(u_n\) is either the Fibonacci sequence \(F_n\) or the sequence of Lucas numbers \(L_n\), \(w=1\), and \(p_1,\dots,p_s\) are the primes up to \(200\).