Take the digits
2, 0, 0 and 3. Make equations equating to all the integers from 1 to 150 using these digits according to the following rules:-
a) The above digits are the only digits to be used and no other digits should appear anywhere in the equation (except on the side where the answer will be).
b) Use of any mathematical symbols are allowed.
c) The digits 2, 0, 0 and 3 should appear in the given order in the equation. e.g - 0 + 2 + 3 + 0 = 5 is not acceptable.
d) When using the mathematical symbols try using the most simplest forms as much as possible.
(In reply to
re(4): did it - aka spoiler by levik)
sorry for the delay here - had the weekend off and dont have the net at home...
I will post for you the solution to 33, since 11 has been solved by others (also, I didn't need my trick for it). Continue on only if you want the answer...
.
.
.
.
.
Since I am net illiterate, this will probably make more sense if you write it down yourself to see the format.
∑ (from n=0) to (2) of (n*n*n*n*n) =33
other sums can be used (different powers of n, powers added and subtracted etc.) and the final 0 and 3 can be used to expand you solutions (i.e., I solved for only 7,8,9,10,11,12, and all of these +18k k up to 8) and used the +/- 3! to arrive at the others. Certainly this does test the problems rule #4, but doesn't exactly break it. I tried to write things in the most simplified way, but I couldn't (i.e. sum n^6 rather than n*n*n*n*n*n), due to the other constraints.
solution
