Large strings of consecutive smooth integers |
| |
Authors: | Filip Najman |
| |
Institution: | (3) Department of Mathematics and Computer Science, Babeş-Bolyai University of Cluj, Cluj-Napoca, Romania;(4) formerly the Technical University of Timişoara, Timişoara, Romania; |
| |
Abstract: | In this note we improve an algorithm from a recent paper by Bauer and Bennett for computing a function of Erdös that measures the minimal gap size f(k) in the sequence of integers at least one of whose prime factors exceeds k. This allows us to compute values of f(k) for larger k and obtain new values of f(k). |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|