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