Perfect powers with few binary digits and related Diophantine problems
From MaRDI portal
Recommendations
- Perfect powers with few binary digits and related Diophantine problems, II
- Some Diophantine problems concerning perfect powers of integers
- Perfect powers with few ternary digits
- scientific article; zbMATH DE number 29929
- Almost perfect powers in consecutive integers
- Some problems involving powers of integers
- Finiteness of odd perfect powers with four nonzero binary digits
- Perfect powers in elliptic divisibility sequences
Cited in
(19)- On the digital representation of integers with bounded prime factors
- On sparse perfect powers
- Products of integers with few nonzero digits
- Finiteness of odd perfect powers with four nonzero binary digits
- Perfect powers in q-binomial coefficients
- Perfect powers with three digits
- scientific article; zbMATH DE number 3120892 (Why is no real title available?)
- Some problems involving powers of integers
- Power values of sums of binary forms
- Squares with Three Nonzero Digits
- Effective irrationality measures for real and p-adic roots of rational numbers close to 1, with an application to parametric families of Thue–Mahler equations
- Perfect powers with few binary digits and related Diophantine problems, II
- Perfect powers with few ternary digits
- Perfect powers with all equal digits but one
- scientific article; zbMATH DE number 7592796 (Why is no real title available?)
- Reverse engineered Diophantine equations over \(\mathbb{Q}\)
- On sparsity of representations of polynomials as linear combinations of exponential functions
- Powers of 3 with few nonzero bits and a conjecture of Erdős
- On the Diophantine equation 1 + 2a + x^b = y^n
This page was built for publication: Perfect powers with few binary digits and related Diophantine problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408138)
