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