Pages that link to "Item:Q4649449"
From MaRDI portal
The following pages link to Perfect powers with few binary digits and related Diophantine problems, II (Q4649449):
Displaying 10 items.
- Bennett's Pillai theorem with fractional bases and negative exponents allowed (Q259512) (← links)
- On the Diophantine equation \(1 + 2^a + x^b = y^n\) (Q740364) (← links)
- The polynomial-exponential equation \(1 + 2^a + 6^b = y^q\) (Q1705835) (← links)
- On the digital representation of integers with bounded prime factors (Q1750369) (← links)
- On sparse perfect powers (Q2077274) (← links)
- On the binary digits of \(n\) and \(n^2\) (Q2098175) (← links)
- Products of integers with few nonzero digits (Q2146239) (← links)
- On a conjecture of Schäffer concerning the equation \(1^k + \ldots + x^k = y^n\) (Q2347036) (← links)
- A Hasse-type principle for exponential Diophantine equations and its applications (Q2792344) (← links)
- PERFECT POWERS WITH THREE DIGITS (Q3191155) (← links)
