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.
You must have seen long-division method to compute decimal representation for fractions. Astonishingly, I never pondered about how one would divide an irrational number to get decimal representation. Firstly, this representation will be approximate. Secondly, we have been doing this in name of “rationalizing the denominator” stating the reason that division by irrationals is not allowed. But, in fact, this is the same problem as faced while analysing division algorithm for Gaussian integers.
Bottom line: Numbers are just symbols. We tend to assign meaning to them as we grow up. Since the set of real numbers, rational numbers and integers form an Euclidean domain, we can write a division algorithm for them. For example, we don’t have special set of symbols for 3 divided by π, but 3 divided by 2 is denoted by 1.5 in decimals.