We show that it is consistent that the reaping number r is less than u , the size of the smallest base for an ultrafilter. To show that our forcing preserves certain ultrafilters, we prove a general partition theorem involving Ramsey ideals.

We continue investigations of reasonable ultrafilters on uncountable cardinals defined in Shelah [8]. We introduce a general scheme of generating a filter on λ from filters on smaller sets and we investigate the combinatorics of objects obtained this way.