The subset-sum problem is one of the most frequently occurring NP (nondeterministic, polynomial-time)-complete) problems. It asks whether a subset of numbers in a set of positive integers adds up ...

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. These computations ...

Variable selection in multiple regression requires identifying the best subset from among a set of candidate predictors. In the case of polynomial regression, the variable selection process can be ...