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