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