I have five kinds of cards(there are unlimited amount of them), , , , , .
I can get numbers by putting the cards in a row (no exponential),and I don't want to put two s together.
For example,I can get to by but not .
I want to use these cards to get to ,what is the least amount of s I have to use?
See similar problem here
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.
2 0 1 8 = 2 ( 1 0 0 8 + 1 ) = 2 ( 2 4 × 3 2 × 7 + 1 ) = ( 1 + 1 ) [ ( 1 + 1 ) ( 1 + 1 ) ( 1 + 1 ) ( 1 + 1 ) ( 1 + 1 + 1 ) ( 1 + 1 + 1 ) ( ( 1 + 1 ) ( 1 + 1 + 1 ) + 1 ) + 1 ]