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