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

 A piece of pie (Posted on 2010-12-07)
Let N be defined by N=> 3*1*4*1*5*9*2, where each asterisk may be replaced by any basic arithmetic sign ( +, - ,* ,/) and => means that the result is obtained by calculating sequentially from left to right.
Examples: 3+1+4+1+5+9+2=>25; 3+1-4+1-5+9-2=>3; 3*1-4*1-5+9-2=>1 etc.

How many distinct positive integer results can be obtained?
What is the lowest positive integer that cannot be obtained?
What positive integer claims the highest quantity of distinct expressions?
Rem: No brackets allowed.

 No Solution Yet Submitted by Ady TZIDON No Rating

 Subject Author Date re(2): piece of cake (solutions?) ed bottemiller 2010-12-07 19:48:47 re(2): piece of cake (solutions?) Charlie 2010-12-07 19:32:44 computer solution Charlie 2010-12-07 19:23:34 re: piece of cake (solutions?) Charlie 2010-12-07 19:20:15 piece of cake (solutions?) ed bottemiller 2010-12-07 18:53:38

 Search: Search body:
Forums (2)