Bifalgorithm post · Brisk · Chapter 1

Are all competitors represented in the sets J and S?

Are all competitors represented in the sets J and S? (Brisk · Chapter 1) — "J ∪ S )? Exactly 1. All of the outcomes are represented in the two sets J and S . (…

Ideas in this flowchart

  • All outcomes are represented in the two sets J and S.
  • The union J ∪ S contains every outcome.
  • J represents the junior competitors.
  • S represents the senior competitors.
  • All competitors are juniors or seniors.
  • The probability of J ∪ S is exactly 1.
Bifalgorithm
Sign up
Feed/

Are all competitors represented in the sets J and S?

Channel

Brisk

1 page

U
USR292600b83e2a
Ebook3w

"J ∪ S )? Exactly 1. All of the outcomes are represented in the two sets J and S . (Put another way, all competitors are juniors or seniors.)"

Flowchart preview
Series cover
👍
0
0 comments0 shares

Sign in to view and post comments.