2013/07/08 by Julia Brandes, Brandes, Julia
Computer Science · Mathematics · #11N25 #11N35 #Chaos-based Image/Signal Encryption #FOS: Mathematics #Number Theory (math.NT) #Numerical Methods and Algorithms #Probability and Statistical Research #math.NT #msc:11N25 #msc:11N35
paper · pdf · doi:10.48550/arxiv.1307.2066
This work has been submitted as a Diploma Thesis to the University of Stuttgart in 2009 essentially in its current form, and is now being made available as interest in this and related problems seems to have recently increased. One should note that the main result has since been improved by Reuss (arXiv:1212.3150) and by forthcoming work of Dietmann and Marmon; Diplomarbeit, Universität Stuttgart, 2009
arxiv created 2013/07/08 · openalex publication_date 2013/07/08 · arxiv updated 2013/07/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We generalise the square sieve developed by Heath-Brown to higher powers in order to improve on the error term for the problem of counting consecutive power-free numbers.