merely fiddlin

For any positive, base-10 integer N, define f(N) as the number of times you have to add up its digits until you get a one-digit number. Find the smallest whole number N such that f(N) = 4. Fiddler on the Proof Although I first gave in to the R brute ...


Continue reading: merely fiddlin

digit digits positive r bloggers reading