The Shape of Ideas

Comic Ideas = Awesome

(via adventuresinlearning)

The Shape of Ideas

Comic Ideas = Awesome

(via adventuresinlearning)

**I don’t care how smart you are, I care how hard you try, how much effort you put in. That’s what makes the difference.**

Bounce The myth of talent and the power of practice By Matthew Syed is such a great book for anyone interested in education, training, and human development.

Join the you can learn anything movement.

Read Salman Khan’s essay on The Learning Myth: Why I’ll Never Tell My Son He’s Smart from Huffington Post.

Beginning with the end in mind. What 41 years of teaching looks like. Thank you again Kid President.

iCE CREAM exponents: Complex number and exponents explained with ice-cream :). [Source]: Ice cream exponents created by Miss Rudolph and Her’s friends.

See more: 90-Degree Rotations in the Complex Plane ( on Wikipedia).

Fractions…

Maths Jokes explained…..Binary and Bases

- "You don’t seem afraid at all. I don’t understand that."
- "Hey, does anyone have a pen?"
- "Hope is a very dangerous thing to lose."
- "You make excellent bait!"
- ”I don’t feel sorry for you, I pity you.”
- "Sorry, fresh out of sweet forgiveness."
- "Sorry. I’m sneakier…

Writing prompts with sentence starters.

Babies

Euclid’s AlgorithmIn mathematics, the

Euclidean algorithm, orEuclid’s algorithm, is a method for computing the greatest common divisor (GCD) of two (usually positive) integers, also known as the greatest common factor (GCF) or highest common factor (HCF). It is named after the Greek mathematician Euclid, who described it in Books VII and X of hisElements.^{}Euclid’s method for finding the greatest common divisor (GCD) of two starting lengths BA and DC, both defined to be multiples of a common “unit” length. The length DC being shorter, it is used to “measure” BA, but only once because remainder EA is less than CD. EA now measures (twice) the shorter length DC, with remainder FC shorter than EA. Then FC measures (three times) length EA. Because there is no remainder, the process ends with FC being the GCD.

Here are two examples of Euclid’s Algorithm written in pseudocode:

A recursive implementation:

Credit: Wolfram Alpha/Wikipedia

e