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