we have to make n with k integers.k integers will have to be choosen from k ranges.Every range has a minimum value and a maximum value.In how many ways we can make n(adsbygoogle = window.adsbygoogle || []).push({});

according to the conditions.For example,k=4,n=10

and the ranges are :

1 1

2 2

3 3

4 4

we can make n in only one way.

Another example is

k=2,n=10

and the ranges are:

1 10

1 10

Here,the result will be 9

How can I find the number of ways by using inclusion-exclusion principle.Can anyone give me hints with better explanation?

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

Dismiss Notice

Join Physics Forums Today!

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

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

# Solving a counting problem

Loading...

Similar Threads - Solving counting problem | Date |
---|---|

B Problem in Counting - Number of Passwords | Feb 23, 2018 |

A Can Somebody solve the Rich Investor's Paradox? | May 22, 2017 |

A Queueing Problem | May 9, 2017 |

Solving Sudoku with logic? | Jun 1, 2015 |

Solving a inclusion-exclusion problem | Nov 18, 2014 |

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