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