Hello(adsbygoogle = window.adsbygoogle || []).push({});

I have N couples of real numbers higher than 1.

Let's call them like (a0,b0), (a1,b1),...,(aN,bN)

I have a number R <= N.

I need the sum of all the possible products of N elements, chosing one from each couple but exactly R times the "b" element and N-R times the "a" element.

Which is the best way to do it?

As an example:

(2,3), (5,7), (11,13)

N = 3, R = 2

I need 2x7x13 + 3x5x13 + 3x7x11

Thank you!

**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!

# Sum of all possible products of elements taken from couples

Loading...

Similar Threads - possible products elements | Date |
---|---|

I Map possible values of a set with a condition to the naturals | Mar 5, 2018 |

B The number of possible combinations with a constraint | Jan 29, 2018 |

I Let A = {1,2,3,4,5,6.} # of many different relations possible | Nov 21, 2016 |

Is it possible to transform infinite sums into infinite products? | Jun 2, 2013 |

Possible Generalization of Cross Product? | Nov 5, 2006 |

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