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