On two theorems of Gelfond and some of their applications

From MaRDI portal
Publication:5542231

DOI10.4064/aa-13-2-177-236zbMath0159.07101OpenAlexW974280868MaRDI QIDQ5542231

Andrzej Schinzel

Publication date: 1967

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/204826



Related Items

On the generalized Ramanujan-Nagell equation \(x^2+(3m^2+1)=(4m^2+1)^n\), Zur Transzendenz gewisser Reihen. (On the transcendence of certain series), Unnamed Item, Minoration de combinaisons linéaires de deux logarithmes $p$-adiques, On the Divisibility a! + b! | (a + b)!, On the digital representation of smooth numbers, On binary recurrence sequences, Greatest prime divisors of polynomial values over function fields, Integers of the form \(n^ 2+1\) without large prime factors, Level of distribution of quadratic polynomials and an upper bound sieve for friable integers, Sur certains produits infinis, Sums of \(S\)-units in the solution sets of generalized Pell equations, Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\), The Diophantine equation f(x)=g(y)$f(x)=g(y)$ for polynomials with simple rational roots, On finiteness of odd superperfect numbers, On the greatest prime factor and divisibility properties of linear recursive sequences, On the diophantine equation \(x^ 2+D=4p^ n\), Numbers in a given set with (or without) a large prime factor, On the number of solutions of Goormaghtigh equation for given \(x\) and \(y\), A note on the paper by Bugeaud and Laurent ``Minoration effective de la distance \(p\)-adique entre puissances de nombres algébriques, Solving exponential diophantine equations using lattice basis reduction algorithms, Lemmes de Schwarz et lemmes d'approximations p-adiques en plusieurs variables, SMOOTH VALUES OF POLYNOMIALS, A note on a conjecture by Ulas on polynomial substitutions, On Prime Factors of Terms of Linear Recurrence Sequences, Greatest prime factor of a polynomial, Two-weight ternary codes and the equation \(y^2=4 \times 3^\alpha+13\), On the Diophantine equation \(y^2=4q^n+4q+1\), A p-adic lower bound for a linear form in logarithms