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