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