Define
as the set of all integers of any length such that each integer is made up of distinct digits and contains either a
or
in it, but not both (or else, 7 will eat 9 again, like how 7 8 9 (7 ate 9)). Furthermore, let
represent the
term in
when the integers in
are arranged from least to greatest (so
,
,
,
,
, etc.). Find the sum of the digits of the value
.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
No explanations have been posted yet. Check back later!