2 citations · 5 across the 8 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.NT2012★ 1 cited
Constructing Carmichael numbers through improved subset-product algorithms
W. R. Alford, Jon Grantham, Steven Hayman +1
We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with k prime factors for every k between 3 and 19,565,220. T…
math.CO2012
Division algorithms for the fixed weight subset sum problem
Andrew Shallue
Given positive integers , the fixed weight subset sum problem is to find a subset of the that sum to , where the subset has a prescribed number of element…