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