All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 A productive s.o.d. (Posted on 2012-09-19)
Let us denote f(n) = 12...12 (repeated n times) and g(n) = 3...3 (repeated n times). For example: f(3) = 121212 and, g(3) = 333.

(i) Determine the distinct digits in the base ten expansion of f(n)*g(n) whenever n ≥ 3

(ii) Express s.o.d (f(n)*g(n)) in terms of n

*** s.o.d (x) denotes the sum of digits in the base ten expansion of x

 No Solution Yet Submitted by K Sengupta No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
 re: A start | Comment 3 of 5 |
(In reply to A start by Jer)

.....We could start by writing formulas for f and g"...

and in the definition f should be g and vice versa.

-JUST FOR THE RECORD. - ...Please edit

 Posted by Ady TZIDON on 2012-09-19 21:43:56

 Search: Search body:
Forums (0)
Random Problem
Site Statistics
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox: