Uncracked 33 (negative integers, exponents)

Uncracked 33 (negative integers, exponents)

Uncracked 114 (Diophantus of Alexandria, c. 215-290) Students working with exponents should be asked to find which values of n from 0-100 are possible by summing the cubes of three positive integers: a^3 + b^3 + c^3 = n. Next, ask if the cubes can be negative. This is...
The Josephus Problem (proof, exponents, algorithm)

The Josephus Problem (proof, exponents, algorithm)

The Josephus Problem (Josephus, 1st Century) This is a great and accessible proof whose basis in historic violence is sure to appeal to that half of the class with too much testosterone. Search for: Recent Posts How to pair up students? A Message to Mathematicians...
Taipei 101 Foundations (multiplication, proof)

Taipei 101 Foundations (multiplication, proof)

Before the wise builder builds – the wise builder thinks. Here we are going to build the foundations of a great skyscraper – Taipei 101. Start with a 6×6 grid. Add numbers or letters or colors to the top left part of the grid as shown. Now is the...