2 months ago

James R. Murphy’s La Guardia students with their string figures.

2 months ago 4 months ago 6 months ago
Packing problem: different ways to pack oranges in two dimensions (left and right); according to Johannes Kepler, the most efficient way to pack spheres in three dimensions is the face-centred cubic arrangement (centre).
Imagine filling a large container with small equal-sized spheres. The density of the arrangement is the proportion of the volume of the container that is taken up by the spheres. In order to maximize the number of spheres in the container, you need to find an arrangement with the highest possible density, so that the spheres are packed together as closely as possible.
Experiment shows that dropping the spheres in randomly will achieve a density of around 65%. However, a higher density can be achieved by carefully arranging the spheres as follows. Start with a layer of spheres in a hexagonal lattice, then put the next layer of spheres in the lowest points you can find above the first layer, and so on – this is just the way you see oranges stacked in a shop. At each step there are two choices of where to put the next layer, so this natural method of stacking the spheres creates an uncountably infinite number of equally dense packings, the best known of which are called cubic close packing and hexagonal close packing. Each of these arrangements has an average density of

The Kepler conjecture says that this is the best that can be done—no other arrangement of spheres has a higher average density.

Packing problem: different ways to pack oranges in two dimensions (left and right); according to Johannes Kepler, the most efficient way to pack spheres in three dimensions is the face-centred cubic arrangement (centre).

Imagine filling a large container with small equal-sized spheres. The density of the arrangement is the proportion of the volume of the container that is taken up by the spheres. In order to maximize the number of spheres in the container, you need to find an arrangement with the highest possible density, so that the spheres are packed together as closely as possible.

Experiment shows that dropping the spheres in randomly will achieve a density of around 65%. However, a higher density can be achieved by carefully arranging the spheres as follows. Start with a layer of spheres in a hexagonal lattice, then put the next layer of spheres in the lowest points you can find above the first layer, and so on – this is just the way you see oranges stacked in a shop. At each step there are two choices of where to put the next layer, so this natural method of stacking the spheres creates an uncountably infinite number of equally dense packings, the best known of which are called cubic close packing and hexagonal close packing. Each of these arrangements has an average density of

The Kepler conjecture says that this is the best that can be done—no other arrangement of spheres has a higher average density.

10 months ago
Why are numbers beautiful? It’s like asking why is Beethoven’s Ninth Symphony beautiful. If you don’t see why, someone can’t tell you. I know numbers are beautiful. If they aren’t beautiful, nothing is. Cite Arrow Paul Erdős
10 months ago
Welcome to another edition of Secretly Judging You

48÷2(9+3) = ????

10 months ago
A sum, proved impossible by the theorem, appears in an episode of The Simpsons, “Treehouse of Horror VI”. In the three-dimensional world in “Homer3”, the equation 178212 + 184112 = 192212 is visible, just as the dimension begins to collapse. The joke is that the twelfth root of the sum does evaluate to 1922 due to rounding errors when entered into most handheld calculators; notice that the left hand side is odd, while 192212 is even, so the equality cannot hold. Instead of 1922, it actually is 1921.999999995 (via Fermat’s Last Theorem in fiction)

A sum, proved impossible by the theorem, appears in an episode of The Simpsons, “Treehouse of Horror VI”. In the three-dimensional world in “Homer3”, the equation 178212 + 184112 = 192212 is visible, just as the dimension begins to collapse. The joke is that the twelfth root of the sum does evaluate to 1922 due to rounding errors when entered into most handheld calculators; notice that the left hand side is odd, while 192212 is even, so the equality cannot hold. Instead of 1922, it actually is 1921.999999995 (via Fermat’s Last Theorem in fiction)

10 months ago
Because of Paul Erdős’ prolific output, friends created the Erdős number as a humorous tribute; Erdős alone was assigned the Erdős number of 0 (for being himself), while his immediate collaborators could claim an Erdős number of 1, their collaborators have Erdős number at most 2, and so on. Approximately 200,000 mathematicians have an assigned Erdős number, and some have estimated that 90 percent of the world’s active mathematicians have an Erdős number smaller than 8 (not surprising in light of the small world phenomenon). Due to collaborations with mathematicians, many scientists in fields such as physics, engineering, biology, and economics have Erdős numbers as well.
 The following table shows the number of people with Erdös number 1, 2, 3, …, according to the electronic data. Note that there are slightly fewer people shown here with Erdös numbers 1 and 2 than in our lists, since our lists are compiled by hand from various sources in addition to MathSciNet. In addition to these people with finite Erdös number, there are about 45,000 mathematicians who have collaborated but have an infinite Erdös number, and 84,000 who have never published joint works (and therefore of course also have an infinite Erdös number).
Erdös number 0 --- 1 person Erdös number 1 --- 502 people Erdös number 2 --- 5713 people Erdös number 3 --- 26422 people Erdös number 4 --- 62136 people Erdös number 5 --- 66157 people Erdös number 6 --- 32280 people Erdös number 7 --- 10431 people Erdös number 8 --- 3214 people Erdös number 9 --- 953 people Erdös number 10 --- 262 people Erdös number 11 --- 94 people Erdös number 12 --- 23 people Erdös number 13 --- 4 people Erdös number 14 --- 7 people Erdös number 15 --- 1 person Erdös number 16 --- 0 people
(Editor’s note: Hank Aaron has an Erdös number of 1 because he and Erdős autographed a baseball when Emory University awarded them both honorary degrees on the same day.)

Because of Paul Erdős’ prolific output, friends created the Erdős number as a humorous tribute; Erdős alone was assigned the Erdős number of 0 (for being himself), while his immediate collaborators could claim an Erdős number of 1, their collaborators have Erdős number at most 2, and so on. Approximately 200,000 mathematicians have an assigned Erdős number, and some have estimated that 90 percent of the world’s active mathematicians have an Erdős number smaller than 8 (not surprising in light of the small world phenomenon). Due to collaborations with mathematicians, many scientists in fields such as physics, engineering, biology, and economics have Erdős numbers as well.

 The following table shows the number of people with Erdös number 1, 2, 3, …, according to the electronic data. Note that there are slightly fewer people shown here with Erdös numbers 1 and 2 than in our lists, since our lists are compiled by hand from various sources in addition to MathSciNet. In addition to these people with finite Erdös number, there are about 45,000 mathematicians who have collaborated but have an infinite Erdös number, and 84,000 who have never published joint works (and therefore of course also have an infinite Erdös number).

Erdös number 0 --- 1 person 
Erdös number 1 --- 502 people
Erdös number 2 --- 5713 people
Erdös number 3 --- 26422 people
Erdös number 4 --- 62136 people
Erdös number 5 --- 66157 people
Erdös number 6 --- 32280 people
Erdös number 7 --- 10431 people
Erdös number 8 --- 3214 people
Erdös number 9 --- 953 people
Erdös number 10 --- 262 people
Erdös number 11 --- 94 people
Erdös number 12 --- 23 people
Erdös number 13 --- 4 people
Erdös number 14 --- 7 people
Erdös number 15 --- 1 person
Erdös number 16 --- 0 people

(Editor’s note: Hank Aaron has an Erdös number of 1 because he and Erdős autographed a baseball when Emory University awarded them both honorary degrees on the same day.)

Gödel’s Incompleteness Theorem

  1. Someone introduces Gödel to a UTM, a machine that is supposed to be a Universal Truth Machine, capable of correctly answering any question at all.
  2. Gödel asks for the program and the circuit design of the UTM. The program may be complicated, but it can only be finitely long. Call the program P(UTM) for Program of the Universal Truth Machine.
  3. Smiling a little, Gödel writes out the following sentence: “The machine constructed on the basis of the program P(UTM) will never say that this sentence is true.” Call this sentence G for Gödel. Note that G is equivalent to: “UTM will never say G is true.”
  4. Now Gödel laughs his high laugh and asks UTM whether G is true or not.
  5. If UTM says G is true, then “UTM will never say G is true” is false. If “UTM will never say G is true” is false, then G is false (since G = “UTM will never say G is true”). So if UTM says G is true, then G is in fact false, and UTM has made a false statement. So UTM will never say that G is true, since UTM makes only true statements.
  6. We have established that UTM will never say G is true. So “UTM will never say G is true” is in fact a true statement. So G is true (since G = “UTM will never say G is true”).
  7. “I know a truth that UTM can never utter,” Gödel says. “I know that G is true. UTM is not truly universal.”

10 months ago