allofthemath:

This, ladies and gentlemen and genderqueer folks, is Pascal’s tetrahedron, a three dimensional analogue of Pascal’s triangle, and it’s pretty freaking great.

allofthemath:

This, ladies and gentlemen and genderqueer folks, is Pascal’s tetrahedron, a three dimensional analogue of Pascal’s triangle, and it’s pretty freaking great.

mathani:

This puzzle consists of four hinged pieces which can be folded one way to a square and the other way to an equilateral triangle. Master puzzler Henry Dudeney demonstrated a wooden model before the London Royal Society in 1905.

mathani:

This puzzle consists of four hinged pieces which can be folded one way to a square and the other way to an equilateral triangle. Master puzzler Henry Dudeney demonstrated a wooden model before the London Royal Society in 1905.

themusicalmathematician:

curiosamathematica:

Spread the word!

Topology holla!

themusicalmathematician:

curiosamathematica:

Spread the word!

Topology holla!

curiosamathematica:

The digits of π, translated into music.

The video also shows some fun facts about π.

proofsareart:

Combinatorics. Combinatorics began as a formalized treatment of efficient ways of counting certain collections of objects which arise relatively often. Nowadays the word ‘combinatorics’ can be used to refer to pretty much all of finite mathematics, and the original field is more specifically called “enumerative combinatorics”.
The things in parentheses are not fractions (they don’t have a fraction bar). These are called binomial coefficients and (n [over] k) represents the number of ways to choose k balls from a set of n balls. Pascal’s triangle is an arrangement of these numbers where (n [over] k) is the k-th number in the n-th row; it is very famous to be a useful way of visualizing many of the properties of the binomial coefficients.
I’m experimenting a little with how to display the theorem statements. Not really sure what I like yet.

proofsareart:

Combinatorics. Combinatorics began as a formalized treatment of efficient ways of counting certain collections of objects which arise relatively often. Nowadays the word ‘combinatorics’ can be used to refer to pretty much all of finite mathematics, and the original field is more specifically called “enumerative combinatorics”.

The things in parentheses are not fractions (they don’t have a fraction bar). These are called binomial coefficients and (n [over] k) represents the number of ways to choose k balls from a set of n balls. Pascal’s triangle is an arrangement of these numbers where (n [over] k) is the k-th number in the n-th row; it is very famous to be a useful way of visualizing many of the properties of the binomial coefficients.

I’m experimenting a little with how to display the theorem statements. Not really sure what I like yet.

illuminanze:

hyrodium:

The proof of Sum of Square Numbers!

This is NOT a proof, but it’s still very beautiful and good for intuition.

"That’s not what I got."

Ancient Math Proverb (via platosdrawings)

"You missed a minus sign"

Ancient math proverb (via physicsshiny)