Sveta makes a math mistake Sveta writes an exists and is unique symbol We call something "free" (e.g. free modules) We do an inductive proof We do a proof by contradiction We adjoin an element to a ring We use the chinese remainder theorem Sveta writes a "warning" Sveta writes the isomorphism symbol We prove an operation is well-defined We use the quotient map Sveta makes a grammatical mistake We use a universal property Sveta writes "iff" We prove something is a ring Sveta writes a "slogan" We prove a lemma Sveta writes "Theorem" Sveta calls a group "Abelian" Sveta writes "Prop" We have a ring that is not commutative We assume something from a previous math class We use the isomorphism theorems We use the inclusion map Sveta makes a math mistake Sveta writes an exists and is unique symbol We call something "free" (e.g. free modules) We do an inductive proof We do a proof by contradiction We adjoin an element to a ring We use the chinese remainder theorem Sveta writes a "warning" Sveta writes the isomorphism symbol We prove an operation is well-defined We use the quotient map Sveta makes a grammatical mistake We use a universal property Sveta writes "iff" We prove something is a ring Sveta writes a "slogan" We prove a lemma Sveta writes "Theorem" Sveta calls a group "Abelian" Sveta writes "Prop" We have a ring that is not commutative We assume something from a previous math class We use the isomorphism theorems We use the inclusion map
(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 makes a math mistake
Sveta writes an exists and is unique symbol
We call something "free" (e.g. free modules)
We do an inductive proof
We do a proof by contradiction
We adjoin an element to a ring
We use the chinese remainder theorem
Sveta writes a "warning"
Sveta writes the isomorphism symbol
We prove an operation is well-defined
We use the quotient map
Sveta makes a grammatical mistake
We use a universal property
Sveta writes "iff"
We prove something is a ring
Sveta writes a "slogan"
We prove a lemma
Sveta writes "Theorem"
Sveta calls a group "Abelian"
Sveta writes "Prop"
We have a ring that is not commutative
We assume something from a previous math class
We use the isomorphism theorems
We use the inclusion map