Ask your own question, for FREE!
Mathematics 21 Online
OpenStudy (anonymous):

plse solve this

OpenStudy (zzr0ck3r):

ha fun!

OpenStudy (imtiaz7):

it is quite typical but fun also

OpenStudy (zzr0ck3r):

lol typical of what?

OpenStudy (imtiaz7):

then solve it

OpenStudy (zzr0ck3r):

now how do you prove the answer is the smallest strokes?

OpenStudy (anonymous):

you can show, via brute force, that all -'s will not work and similarly if you only had 1 "2-stroke" operation (addition/multiplication). In this way will will need at least 10 strokes.

OpenStudy (dan815):

|dw:1375772311661:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!