Abstract
Finite and infinite-time classical ruin probabilities can be approximated in Gerber's elementary binomial risk model. In order to obtain good results, rather fine discretizations may be necessary and then the computing times may be much too long. Here we show how rather rough discretizations provide approximations of excellent quality when a new claimsize distribution (with one negative probability mass!!!) is adopted and when a new security loading is introduced.