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