The thread revolves around sharing and discussing bad math jokes, with participants contributing various humorous anecdotes, puns, and references to mathematical concepts and figures. The scope includes light-hearted jokes, memes, and playful interactions related to mathematics and its terminology.
Discussion Character
Exploratory
Conceptual clarification
Debate/contested
Main Points Raised
Some participants share jokes, such as the sailor knot joke and various puns related to mathematics and knot theory.
Others reference mathematical concepts like Kruskal's tree theorem and the busy beaver function in a humorous context.
There are jokes involving famous figures in mathematics, such as Pythagoras, and playful takes on mathematical expressions.
Some participants engage in discussions about the humor in probability problems and the implications of certain mathematical scenarios.
Several jokes reference popular culture, including Doctor Who, and the humor derived from misunderstandings or wordplay.
Participants also mention historical comedic references, such as Abbott and Costello, and their relevance to math humor.
Areas of Agreement / Disagreement
Participants generally share a light-hearted approach to the topic, contributing jokes and humorous observations. However, there is no consensus on which jokes are the best or most effective, and the humor is subjective, leading to a variety of interpretations and responses.
Contextual Notes
Some jokes rely on specific mathematical knowledge or cultural references that may not be universally understood, which could limit their accessibility to all participants.
Who May Find This Useful
This discussion may be of interest to those who enjoy mathematics, humor, and wordplay, as well as fans of popular culture references related to math.
– The Mandelbrot set is named after Benoit B. Mandelbrot
– What does the B. stand for?
– B. stands for Benoit B. Mandelbrot
In a similar vein, Kernighan and Ritchie's classic text "The C Programming Language" has an index entry for "recursion", which includes its own page number.
I was curious to how meticulous Randall Monroe in his probability calculations. Did he just throw some dice figures in there hoping nobody would check, or was he actually pretty close?
Here's a repost of comic, in case it's not showing up in the quote above.
Well, I wrote a computer program to calculate the probabilities of summing up different types of dice rolling, to find out how close he was.
First let's analyze the drawing of arrows. This is easy. 5 out the the 10 arrows are cursed, so there's a 50% chance that the first arrow picked is not cursed. Now there are only 4 uncursed arrows out of 9. So the chance of the second draw, also being uncursed (given the first arrow was uncursed) is 4/9. So the probability of both arrows are uncursed is
So the probability of at least one of the arrows cursed is the probability inverse of that,
[itex]\left( 1 - \frac{2}{9} \right) = \frac{7}{9}[/itex]= 0.7777777...
We'll come back to that. Now let's analyze the dice.
In order to calculate the sum of multiple dice, we perform a linear convolution of the probability density function (PDF) of each of the dice, for all the dice thrown.
According to the comic, he must roll three 6-sided dice, plus one 4-sided die and add the results together.
To calculate the probabilities of all of that, we convolve the PDF of a six-sided dice with itself and then again (3 PDFs convolved total so far), and then convolve that with a four-sided die.
Using the computer program, the PDF of the whole operation was:
According to the program, rolling a 15 or below is exactly the same probability of drawing at least one of the cursed arrows. So one would need to roll a 16 or greater to avoid the cursed arrows.
So Randall Monroe was not just close, he was exactly on the mark. Kudos to his attention to detail.
Here's the C# class that does most of the work:
[CODE title="DiceConvolution.IntegerDistribution"]using System;
using System.Collections.Generic;
using System.Linq;
using System.Numerics;
using System.Text;
using System.Threading.Tasks;
using System.Xml;
namespace DiceConvolution
{
internal class IntegerDistribution
{
// public properties
public int startingIndex { get; private set; } // typically the first nonzero index. The first index of importance. For a standard die, this is 1.
public double[] probabilityDensityArray { get; private set; } // The zero based array of probabilities (shifted to start at array index 0).
// methods
public IntegerDistribution convolve (IntegerDistribution a)
{
// create a reversed version of the input a
double[] aReversed = new double[a.probabilityDensityArray.Length];
Array.Copy(a.probabilityDensityArray, aReversed, a.probabilityDensityArray.Length);
Array.Reverse(aReversed);
double[] output = new double[aReversed.Length + probabilityDensityArray.Length - 1];
// Convolution
for (int i = 0; i < output.Length; i++)
{
output = 0;
for(int j = 0; j < aReversed.Length; j++)
{
// Only integrate legal portions of the arrays
if(i - j >= 0 && i - j < probabilityDensityArray.Length)
{
output += probabilityDensityArray[i - j] * aReversed[j];
}
}
}
return new IntegerDistribution(startingIndex + a.startingIndex, output);
}
public IntegerDistribution clone()
{
double[] array = new double[probabilityDensityArray.Length];
Array.Copy(probabilityDensityArray, array, probabilityDensityArray.Length);
return new IntegerDistribution(startingIndex, array);
}
public static IntegerDistribution operator+ (IntegerDistribution a, IntegerDistribution b)
{
return a.convolve(b);
}
public double[] cumulative()
{
double total = 0;
double[] output = new double[probabilityDensityArray.Length];
for (int i = 0;i < output.Length;i++)
{
total += probabilityDensityArray;
output = total;
}
return output;
}
public static IntegerDistribution operator* (int a, IntegerDistribution b)
{
IntegerDistribution output = b.clone();
for (int i = 2; i <= a; i++) output += b;
return output;
}
}
}
[/CODE]
And the main program to run it:
[CODE title="Main program"]// Main program
using DiceConvolution;
for (int i = 0; i < c.probabilityDensityArray.Length; i++)
{
Console.WriteLine(c.startingIndex + i + " " + cumulative);
}[/CODE]
#314
DaveC426913
Gold Member
2025 Award
24,569
8,925
collinsmark said:
I was curious to how meticulous Randall Monroe in his probability calculations. Did he just throw some dice figures in there hoping nobody would check, or was he actually pretty close?
...According to the program, rolling a 15 or below is exactly the same probability of drawing at least one of the cursed arrows. So one would need to roll a 16 or greater to avoid the cursed arrows.
So Randall Monroe was not just close, he was exactly on the mark. Kudos to his attention to detail.
I would have been astonished if he wasn't accurate. It's what he does.
That aside, kudos to you for verifying by code. That's the kind of next-level compulsion I pay my internet bill for.
Me three. Was that the whole point of the "joke", to get us to waste a few seconds, or is there some meaning to one of the numbers?
#320
Arjan82
625
619
Me four... Also, the only 'meaning' I've found is that the square root of 37.21 is exactly 6.1. I've converted that to binary but that didn't tell me anything...
Me four... Also, the only 'meaning' I've found is that the square root of 37.21 is exactly 6.1. I've converted that to binary but that didn't tell me anything...
It works because a nautical mile is based on a degree of latitude, and the Earth (e) is a circle.
The nautical mile is actually based on one arc minute of longitude.
The speed of light is sea. Mean sea level is the same, wherever you measure it. You can check because the sea level rises to the plimsoll or load line on a boat, no matter where on Earth you measure it.
One statute mile is 1.609344 km.
One nautical mile is 1.852000 km.
One knot is one nautical mile per hour.
e nautical miles = 5034.258 m.
Pi statute miles = 5055.903 m. They differ by 0.43%
The close coincidence rests on the definition of the statute mile, as used in the UK and the US, being 5280 English feet.
The Royal Observatory, Greenwich, defined one nautical mile, to subtend an arc of one minute, along the equator. So there are 360*60=21,600 nautical miles around the equator = 40,003.2 km.
Napoleon defined the metre to be one ten millionth of the distance from the North Pole to the equator, through Paris. That makes the Earth's polar girth 40,000.0 km, which is shorter than the equatorial girth of 40,003.2 km.
The English and the French have a love-hate relationship, so can never agree to disagree.
#324
Arjan82
625
619
Baluncore said:
The nautical mile is actually based on one arc minute of longitude.
Latitude though... If it is based on longitude, the mile is longest at the equator and zero at the poles...
Latitude though... If it is based on longitude, the mile is longest at the equator and zero at the poles...
Latitude was used originally to define the metre, not the nautical mile.
Baluncore said:
The Royal Observatory, Greenwich, defined one nautical mile, to subtend an arc of one minute, along the equator.
The nautical mile was defined by longitude at the equator, NOT latitude anywhere.
#326
Arjan82
625
619
Baluncore said:
The nautical mile was defined by longitude at the equator, NOT latitude anywhere.
Hmmm, ok, I didn't know that...
I've always been taught that if you want to measure a nautical mile on a chart (you know, an actual physical one...) with your divider (an actual physical thing you know...) you need to measure one minute along the latitude, not longitude, because that would only work on the equator. But that doesn't mean that it is defined that way of course... That's where my confusion comes from.
