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