On Wed, 29 Jul 2015, Paul Rubin wrote:

> Here is an exercise that is easy in Haskell but surprisingly tedious in
> languages like Ada: a number is "5-smooth" or "Hamming" if it has no
> prime factors greater than 5.  So 10, 12, and 15 are 5-smooth but 11,
> 13, and 14 are not.  The first 20 Hamming numbers are:
>
>   [1,2,3,4,5,6,8,9,10,12,15,16,18,20,24,25,27,30,32,36]
>
> I was going to ask for the millionth such number, but you need arbitrary
> precision arithmetic for it.  So, what is the 10000th such number?  That
> one fits in 64 bits, but is not really feasible to reach by counting.
>

http://rosettacode.org/wiki/Hamming_numbers#Ada

--------  I  love  the  taste  of  Cryptanalysis  in  the morning!  --------
www.uni-weimar.de/de/medien/professuren/mediensicherheit/people/stefan-lucks
----Stefan.Lucks (at) uni-weimar.de, Bauhaus-Universität Weimar, Germany----