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