On a combinatorial method for counting smooth numbers in sets of integers

Type: Article

Publication Date: 2007-02-10

Citations: 7

DOI: https://doi.org/10.1016/j.jnt.2007.01.004

Locations

  • Journal of Number Theory - View

Similar Works

Action Title Year Authors
+ A Combinatorial Method for Counting Smooth Numbers in Sets of Integers 2003 Ernie Croot
+ An algorithm for counting smooth integers 2016 Shamil Ishmukhametov
F. F. Sharifullina
+ On Elements of Sumsets with Many Prime Factors 1993 P. Erdős
Carl Pomerance
Andràs Sárközy
C. L. Stewart
+ PDF Chat Arithmetic properties of positive integers with fixed digit sum 2006 Florian Luca
+ Integers with a large smooth divisor 2006 William D. Banks
Igor E. Shparlinski
+ PDF Chat Integers with a Large Smooth Divisor 2007 William D. Banks
Igor E. Shparlinski
+ Sums and Products with Smooth Numbers 2010 William D. Banks
David S. Covert
+ Sums and Products with Smooth Numbers 2010 William D. Banks
David Covert
+ Counting integers with a smooth totient 2018 William D. Banks
John Friedlander
Carl Pomerance
Igor E. Shparlinski
+ Smooth numbers: computational number theory and beyond 2008 Andrew Granville
+ The number of rationals determined by large sets of sifted integers 2022 Olivier Ramaré
+ PDF Chat On sums of large sets of integers 1964 J. H. B. Kemperman
+ PDF Chat On Sums of Large Sets of Integers 1964 J. H. B. Kemperman
+ PDF Chat Sums and products with smooth numbers 2011 William D. Banks
David Covert
+ Sums of Integers 2015 John W Dawson
+ On sums of distinct integers belonging to certain sequences 1983 Alberto Perelli
Umberto Zannier
+ PDF Chat The Distribution of Smooth Numbers in Arithmetic Progressions 1992 Antal Balog
Carl Pomerance
+ PDF Chat Large strings of consecutive smooth integers 2011 Filip Najman
+ Character sums with smooth numbers 2017 Igor E. Shparlinski
+ Character sums with smooth numbers 2017 Igor E. Shparlinski