Came to know about the following problem from a friend which can be simplified to the following:(adsbygoogle = window.adsbygoogle || []).push({});

A_{1}, A_{2}, ....A_{m}and B_{1}, B_{2},...B_{n}are two groups of sets each group spanning the sample space.

Now there are p elements in each of A_{i}and each element is in exactly p_{1}of the sets of the A group.

Again there are q elements in each of B_{i}and each element is in exactly q_{1}of the sets of the B group.

We have to write, 'n' in terms of m,p,p_{1},q,q_{1}. Thanks for any ideas.

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

# I Counting the number of sets.

Have something to add?

Draft saved
Draft deleted

Loading...

Similar Threads - Counting number sets | Date |
---|---|

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

Fitting distribution to histogram with low number of counts | Feb 24, 2015 |

Counting Number of Possible Hand Gestures | Oct 27, 2011 |

Count the number of winnable Freecell games? | Nov 5, 2005 |

Counting phone numbers | Nov 12, 2004 |

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