Sveta writes "Theorem" We use a universal property We use the quotient map Sveta makes a grammatical mistake Sveta writes "iff" Sveta writes the isomorphism symbol Sveta calls a group "Abelian" Sveta writes an exists and is unique symbol We prove an operation is well-defined We do an inductive proof We use the inclusion map We call something "free" (e.g. free modules) We adjoin an element to a ring We prove something is a ring We prove a lemma We use the isomorphism theorems Sveta writes a "slogan" Sveta writes a "warning" We have a ring that is not commutative Sveta writes "Prop" We assume something from a previous math class We use the chinese remainder theorem We do a proof by contradiction Sveta makes a math mistake Sveta writes "Theorem" We use a universal property We use the quotient map Sveta makes a grammatical mistake Sveta writes "iff" Sveta writes the isomorphism symbol Sveta calls a group "Abelian" Sveta writes an exists and is unique symbol We prove an operation is well-defined We do an inductive proof We use the inclusion map We call something "free" (e.g. free modules) We adjoin an element to a ring We prove something is a ring We prove a lemma We use the isomorphism theorems Sveta writes a "slogan" Sveta writes a "warning" We have a ring that is not commutative Sveta writes "Prop" We assume something from a previous math class We use the chinese remainder theorem We do a proof by contradiction Sveta makes a math mistake
(Print) Use this randomly generated list as your call list when playing the game. There is no need to say the BINGO column name. Place some kind of mark (like an X, a checkmark, a dot, tally mark, etc) on each cell as you announce it, to keep track. You can also cut out each item, place them in a bag and pull words from the bag.
Sveta writes "Theorem"
We use a universal property
We use the quotient map
Sveta makes a grammatical mistake
Sveta writes "iff"
Sveta writes the isomorphism symbol
Sveta calls a group "Abelian"
Sveta writes an exists and is unique symbol
We prove an operation is well-defined
We do an inductive proof
We use the inclusion map
We call something "free" (e.g. free modules)
We adjoin an element to a ring
We prove something is a ring
We prove a lemma
We use the isomorphism theorems
Sveta writes a "slogan"
Sveta writes a "warning"
We have a ring that is not commutative
Sveta writes "Prop"
We assume something from a previous math class
We use the chinese remainder theorem
We do a proof by contradiction
Sveta makes a math mistake