Hey guys,(adsbygoogle = window.adsbygoogle || []).push({});

I'm searching a formula for this kind of situation :

We have a list of values (33,60,50,15,100) and a target (520). We want to know how many times each value can go in the target (close to) with those specifications :

- Maximum 2 different value at the time

- Minimum use of values

I'm pretty sure, there is a formula out there that respond to our situation.

Best regards,

P.S.: Forgive my English speaking, it's not my primary language.

**Physics Forums - The Fusion of Science and Community**

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

# Nesting Algorithm

Loading...

Similar Threads - Nesting Algorithm | Date |
---|---|

B Non-algorithmic math | Oct 13, 2017 |

B How to compare two huge numbers with nested exponentials? | Apr 18, 2016 |

De-nesting radicals | Oct 23, 2014 |

Nested Exponents | Nov 22, 2012 |

Question about nested intervals. | May 12, 2012 |

**Physics Forums - The Fusion of Science and Community**