Jason Gibson

most citedThe distribution of r-free numbers in arithmetic progressions

3 citations · 3 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2017

Fully-projected subsets

Jason Gibson

Let $k$ and $i_{1}, \dots, i_{n}$ be natural numbers. Place $k$ balls into a multidimensional box of $i_{1} \times \dots \times i_{n}$ cells, no more than one ball to each cell, such that th…

math.NT2013★ 3 cited

The distribution of r-free numbers in arithmetic progressions

Jason Gibson

A positive integer n is called r-free if n is not divisible by the r-th power of a prime. Generalizing earlier work of Orr, we provide an upper bound of Bombieri-Vinogradov type fo…