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