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