Tag Archives: divisor

MaBloWriMo 24: Bezout’s identity

Posted on November 25, 2015 by Brent

A few days ago we made use of Bézout’s Identity, which states that if and have a greatest common divisor , then there exist integers and such that . For completeness, let’s prove it. Consider the set of all linear … Continue reading →

Posted in algebra, arithmetic, modular arithmetic, number theory | Tagged , , , , , , , | 2 Comments

Divisor nim

Posted on February 3, 2010 by Brent

Yesterday in math club I had the students play a game which I dimly remember seeing somewhere but forget where. Since I don’t know what it is really called, I’m calling it “divisor nim”. Here’s how it works: The players … Continue reading →

Posted in games, number theory, pattern | Tagged , , | 2 Comments