The Shaving Cadre

Welcome to The Shaving Cadre, a forum dedicated to gentlemanly discourse about wet shaving and other topics of common interests. Membership is always free so register today and join in the fun

Bingo Game #63 - Traditional Bingo

giphy.gif
 
Well well well how should we begin today? Do we want to chase links? Do Math? Simple calls? Hmmmmm

1724423824017.png
 
Just do simple calls and we won't pluck out every one of the hairs on your body.
 
What is the 7th number of relations of valence >= 1 on an n-set?

The answer is your bingo call.
 
What is the 7th number of relations of valence >= 1 on an n-set?

The answer is your bingo call.
The problem you've posed is a bit ambiguous. Could you please clarify what you mean by "relations of valence >= 1 on an n-set"?


Here are some possible interpretations:


  • Relations with at least one element in their domain: If this is the case, then the 7th number of such relations would be 2^n - 1. This is because there are 2^n possible subsets of an n-set (including the empty set), and we need to exclude the empty set to get relations with at least one element.
  • Relations with at least one element in their range: If this is the case, then the 7th number of such relations would also be 2^n - 1, for the same reason as above.
  • Relations with at least one pair (a, b) such that a is related to b: If this is the case, then the 7th number of such relations would be 2^(n^2) - 1. This is because there are 2^(n^2) possible binary relations on an n-set, and we need to exclude the empty relation (where no element is related to any other element).

If you could provide more context or information about what you mean by "valence >= 1", I would be happy to give you a more accurate answer.
 
The problem you've posed is a bit ambiguous. Could you please clarify what you mean by "relations of valence >= 1 on an n-set"?


Here are some possible interpretations:


  • Relations with at least one element in their domain: If this is the case, then the 7th number of such relations would be 2^n - 1. This is because there are 2^n possible subsets of an n-set (including the empty set), and we need to exclude the empty set to get relations with at least one element.
  • Relations with at least one element in their range: If this is the case, then the 7th number of such relations would also be 2^n - 1, for the same reason as above.
  • Relations with at least one pair (a, b) such that a is related to b: If this is the case, then the 7th number of such relations would be 2^(n^2) - 1. This is because there are 2^(n^2) possible binary relations on an n-set, and we need to exclude the empty relation (where no element is related to any other element).

If you could provide more context or information about what you mean by "valence >= 1", I would be happy to give you a more accurate answer.
Hmmm interesting.... you have presented a FINE argument. However, I will not give you any more information at this time aside from the hint in this post.
 
What is the 7th number of relations of valence >= 1 on an n-set?

The answer is your bingo call.
Here we @()$(@*# @ go again. And he STILL hasn't clarified the first issue.

Thus, when looking for the seventh number in this sequence (which corresponds to n=7), we find:

The answer is:
562949953421311
 
OK that is it. A command Decision has been made @CVargo aka Chad, aka Sasquatch, aka Mary the White Claw drinker, aka Sally the Busch Beer drinker has now been identified as the most callous, dirty, rule breaking caller since the "ol days" of B&B and did it on only 3 days THIS WILL HAVE a new CT.....

giphy.gif
 
Hmmm interesting.... you have presented a FINE argument. However, I will not give you any more information at this time aside from the hint in this post.
This is what happens when you work from home and have nothing better to do but drink coffee and call bingo like this!
 
Back
Top