  function Aug28()
% The number of bits  required to represent 5^k is ceil(k*log2(5));
% There are 52 bits in the IEEE 64-bit word
% Noting that 10^k = (2^k)(5^k), we see that the answer is
% the largest k so ceil(k*log2(5))<=52
%

% For any integer k, write  = (power of 2)*n(k) where n(k) is not divisible
% by 2.

n = [1 1 3 1 5 3 7 1 9 5 11 3 13 7 15 1 17 9 19 5 21 11 23];
% Why does this show that n = 22 is the answer?
[prod(n(1:22)); 2^52; prod(n)]
