- #1
iScience
- 466
- 5
Take a number r that is n-digits long where n is finite.
so if r =2385813...
$$r_1r_2r_3...r_n$$
$$r_1 = 2$$
$$r_2 = 3$$
$$r_3 = 8$$
etc..
I postulate (since I don't know this is true): Every such number can be expressed as a division between two other numbers, say a and b.
$$r = \frac{a}{b}$$
How would you go about finding a and b optimized by minimizing the number of digits in a and b?
In other words, there are an infinite number of combinations of a and b. but of that set of combinations, I want the one that requires the least number of digits in a and b combined.
so if r =2385813...
$$r_1r_2r_3...r_n$$
$$r_1 = 2$$
$$r_2 = 3$$
$$r_3 = 8$$
etc..
I postulate (since I don't know this is true): Every such number can be expressed as a division between two other numbers, say a and b.
$$r = \frac{a}{b}$$
How would you go about finding a and b optimized by minimizing the number of digits in a and b?
In other words, there are an infinite number of combinations of a and b. but of that set of combinations, I want the one that requires the least number of digits in a and b combined.