This is a continuation of previous post:
How many distinct numbers can be formed by using four 2s and the four arithmetic operations .
(note that some binary operations do not make sense without parenthesis)
I have no idea about how to approach this problem (since I am not very comfortable with combinatorics). So any help will be appreciated.
Edit[29 May 2017]: This problem has been solved in the comments below.
Following is a very common arithmetic puzzle that you may have encountered as a child:
Express any whole number using the number 2 precisely four times and using only well-known mathematical symbols.
This puzzle has been discussed on pp. 172 of Graham Farmelo’s “The Strangest Man“, and how Paul Dirac solved it by using his knowledge of “well-known mathematical symbols”:
This is an example of thinking out of the box, enabling you to write any number using only three/four 2s. Though, using a transcendental function to solve an elementary problem may appear like an overkill. But, building upon such ideas we can try to tackle the general problem, like the “four fours puzzle“.
This post on Puzzling.SE describes usage of following formula consisting of trigonometric operation and to obtain the square root of any rational number from 0:
Using this we can write using two 2s:
or even with only one 2: