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