On two theorems of Gelfond and some of their applications
DOI10.4064/AA-13-2-177-236zbMATH Open0159.07101OpenAlexW974280868MaRDI QIDQ5542231FDOQ5542231
Authors: Andrzej Schinzel
Publication date: 1967
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/204826
measure of irrationalityexponential Diophantine equationslinear recurrencesgreatest prime factor of polynomials in integersp-adic measure of irrationalityratio of two logarithms of algebraic numbers
Recurrences (11B37) Exponential Diophantine equations (11D61) Linear forms in logarithms; Baker's method (11J86)
Cited In (32)
- Sur certains produits infinis
- A p-adic lower bound for a linear form in logarithms
- A Gel'fond type criterion in degree two
- On prime factors of terms of linear recurrence sequences
- Numbers in a given set with (or without) a large prime factor
- A note on a conjecture by Ulas on polynomial substitutions
- SMOOTH VALUES OF POLYNOMIALS
- Minoration de combinaisons linéaires de deux logarithmes $p$-adiques
- Greatest prime divisors of polynomial values over function fields
- A note on the paper by Bugeaud and Laurent ``Minoration effective de la distance \(p\)-adique entre puissances de nombres algébriques
- On the greatest prime factor and divisibility properties of linear recursive sequences
- Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
- On the Diophantine equation \(y^2=4q^n+4q+1\)
- The Diophantine equation f(x)=g(y)$f(x)=g(y)$ for polynomials with simple rational roots
- On the digital representation of smooth numbers
- On the Divisibility a! + b! | (a + b)!
- Solving exponential diophantine equations using lattice basis reduction algorithms
- On the number of solutions of Goormaghtigh equation for given \(x\) and \(y\)
- On the diophantine equation \(x^ 2+D=4p^ n\)
- Zur Transzendenz gewisser Reihen. (On the transcendence of certain series)
- Greatest prime factor of a polynomial
- 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
- Two-weight ternary codes and the equation \(y^2=4 \times 3^\alpha+13\)
- Sums of \(S\)-units in the solution sets of generalized Pell equations
- Lemmes de Schwarz et lemmes d'approximations p-adiques en plusieurs variables
- On finiteness of odd superperfect numbers
- Some applications of Gelfand pairs to number theory
- On binary recurrence sequences
- Two problems on the greatest prime factor of \(n^2+1\)
- Title not available (Why is that?)
- On the generalized Ramanujan-Nagell equation \(x^2+(3m^2+1)=(4m^2+1)^n\)
This page was built for publication: On two theorems of Gelfond and some of their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5542231)