Re: [math-fun] Beastly number problem

I'll start the bidding with f(16) = 4163. --Rich ---------------- Quoting David Wilson <davidwwilson@comcast.net>:

A beastly number (A051003) is a number with substring 666.

It is easy enough to prove that for each positive integer n, there is an integer k such that kn is beastly. Let f(n) be the smallest such k.

Show that f(n) is bounded over all integers n. What is the largest possible value of f(n)?

_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun