Take a number(adsbygoogle = window.adsbygoogle || []).push({}); that is n-digits long where n is finite.r

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, sayanda.b

$$r = \frac{a}{b}$$

How would you go about finding a and boptimized 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.

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Optimization Problem -- Can a number always be expressed as the ratio of two other numbers?

Have something to add?

Draft saved
Draft deleted

Loading...

Similar Threads for Optimization Problem number |
---|

C/++/# Problems with #include<complex.h> |

Running a multidimensional problem on a single core |

JavaScript Problem using dat.GUI controller library |

Fortran Fortran for Computational Fluid Dynamics Problems |

Hacking: Legal and Ethical Problems |

**Physics Forums | Science Articles, Homework Help, Discussion**