Brown Numbers - Numberphile

TL;DR

Brown numbers are pairs of integers where n factorial plus 1 equals m squared.

Transcript

PROFESSOR ED COPELAND: I know that from looking at Numberphiles how many of the viewer comment all the time about the brown paper that you use. So I thought it'd be appropriate to introduce the Brown numbers. This is short but sweet. And I think it could be a challenge for the mathematically inclined Numberphile viewers. It's really straightforward... Read More

Key Insights

• ❎ Brown numbers are defined by the equation n factorial plus 1 equals m squared.
• #️⃣ Examples of Brown numbers include (5, 4), (11, 5), and (71, 7).
• 🤎 Paul Erdos conjectured that there are only three Brown numbers, but it lacks a formal proof.
• 👨‍⚕️ Erdos was a unique and eccentric mathematician who made significant contributions to the field.
• #️⃣ The rarity and properties of Brown numbers make them captivating subjects of mathematical exploration.
• 👶 Finding new Brown numbers could potentially challenge Erdos's conjecture.
• #️⃣ Understanding the relationship between factorials and perfect squares is key to studying Brown numbers.

Questions & Answers

Q: What are Brown numbers?

Brown numbers are pairs of integers (m and n) that satisfy the equation n factorial plus 1 equals m squared. For example, (5, 4) is a Brown number because 4 factorial plus 1 equals 5 squared.

Q: How many Brown numbers are there?

The mathematician Paul Erdos conjectured that there are only three Brown numbers, but this has not been proven. So far, (5, 4), (11, 5), and (71, 7) are known Brown numbers.

Q: Why are Brown numbers significant?

Brown numbers have a special property that connects factorials and perfect squares. Their rarity and uniqueness make them intriguing to mathematicians and enthusiasts. Understanding the properties of Brown numbers could lead to further insights in number theory.

Q: How did Paul Erdos make his conjecture?

Paul Erdos was a highly respected mathematician known for his collaborations and contributions. While there is no proof for his conjecture about Brown numbers, Erdos likely based it on extensive exploration and analysis of various integers.

Summary & Key Takeaways

• Brown numbers are defined as pairs of integers (m and n) that satisfy the equation n factorial plus 1 equals m squared.

• Examples of Brown numbers include (5, 4), (11, 5), and (71, 7).

• Paul Erdos, a renowned mathematician, conjectured that there are only three Brown numbers, but this has not been proven.