There are ways in which we can fill the squares with the mathematical operators and .
How many ways would make the equation true?
Note : Obey the order of operations.
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.
Let the sum be N = 1 □ 2 □ 3 □ 4 □ 5 □ 6 . Consider all the squares be switches and the switch before 2 be s 2 , 3 be s 3 , 4 be s 4 , 5 be s 5 and 6 be s 6 . The maximum value of N is 2 1 when all the switches are ON or + . We note that when we switch s n OFF or to − , we minus 2 n from 2 1 . For N = 7 = 2 1 − 1 4 = 2 1 − 2 ( 7 ) . We need to switch OFF switches, where the sum of their numbers is 7 . And there are only 2 ways to do this; that is when 3 + 4 and 2 + 5 .