Construct a HashedFeatureMap by finding the greatest prime below the feature bound.
Construct a HashedFeatureMap by finding the greatest prime below the feature bound. Obviously could be more efficient, but we pay the price once up front, and it is reasonably fast up to 10,000,000 or so.