scientific article; zbMATH DE number 124354
[For the entire collection see Zbl 0745.00060.] For an integer \(x\), let \(u(x)=\prod_{p| x} p\); the largest square free factor of \(x\). This paper discusses the problem of proving lower bounds for \(u(xy)\) when \(x\) and \(y\) are integers which are close to each other. Often this takes the form of inequalities of the form \((x- y)u(xy)\geq f(y)\) for integers \(0<x<y\). Such inequalities are deduced not only from results proved via Baker's method of linear forms in logarithms, but also diophantine conjectures such as Hall's conjecture and the \(abc\) conjecture. The author also finds various (conjectural and proved) lower bounds for \(| x-y|\) if \(u(x)=u(y)\) but \(x\neq y\); such questions have applications in logic.
- scientific article; zbMATH DE number 4095603
- Entiers Sans Grand Facteur Premier En Progressions Arithmetiques
- scientific article; zbMATH DE number 5678253
- scientific article; zbMATH DE number 2108682
- scientific article; zbMATH DE number 4163007
- Product of an integer free of small prime factors and prime in arithmetic progression
- Sur le nombre des entiers sans grand facteur premier. (On the number of integers without large prime factor)
- Multiplicative partitions of numbers with a large squarefree divisor
- Quadrafree \textit{factorisatio numerorum}
- scientific article; zbMATH DE number 3117651
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4025976)
