Pages that link to "Item:Q935925"

The following pages link to The Diophantine equation \((x^{k} - 1)(y^{k} - 1) = (z^{k} - 1)^{t}\) (Q935925):

Displaying 14 items.

• A note on the Diophantine equation \(f(x) f(y) = f(z^2)\) (Q519914) (← links)
• Almost perfect powers in consecutive integers. II (Q735435) (← links)
• On the Diophantine equation \((x^2+k)(y^2+k)=(z^2+k)^2\) (Q1011124) (← links)
• On the Diophantine system \(f(z)= f(x) f(y)= f(u) f(v)\) (Q1705226) (← links)
• On the Diophantine equation \((x^ k-1)(y^ k-1)=(z^ k-1)\). (Q1890409) (← links)
• Diophantine approximation and the equation \((a^2 c x^k - 1)(b^2 c y^k - 1) = (a b c z^k - 1)^2\) (Q2343173) (← links)
• Another generalization of a theorem of Baker and Davenport (Q2406376) (← links)
• The Diophantine equation \((ax^k-1)(by^k-1)=abz^k-1\) (Q2637188) (← links)
• Solution of the Diophantine equation \(x_1 x_2 x_3\cdots x_{m-1} = z^n\) (Q2803736) (← links)
• On the Diophantine equation \((x-1)^k+x^k+(x+1)^k=y^n\) (Q2875454) (← links)
• Note on the Diophantine Equation Xt + Yt = BZt (Q2999534) (← links)
• (Q3432065) (← links)
• On the Diophantine equation $f(x)f(y)=f(z)^n$ involving Laurent polynomials, II (Q5237147) (← links)
• An algorithm which transforms any Diophantine equation into an equivalent system of equations of the forms x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k (Q5401917) (← links)