The Byrdseed.TV registration window closes in less than a week! Check it out.

Byrdseed

  • About
  • Speaking
  • Puzzlements
  • ByrdseedTV
  • Big Ideas
  • Examples
  • Depth and Complexity
  • Archives

Goldbach’s Conjecture

Math conjectures

Our look at [math curiosities](https://www.byrdseed.com/category/differentiating/differentiating-math/math-curiosities/ continues with Goldbach’s Conjecture.

Remember that a conjecture is a statement believed to be true, but unproven. It’s an authentic, unsolved problem, but simple enough for students to explore.

Goldbach’s Conjecture states:

Every even integer greater than two can be written as the sum of two primes.

Examples

  • 6 = 3 + 3
  • 12 = 7 + 5
  • 20 = 7 + 13

Play with an interactive version of this conjecture here.

Unproven

As with all conjectures, mathematicians believe this to be true for all cases, but no one has proven it yet. The best part is: they’ve had over 270 years – Christian Goldbach made this conjecture in 1742!

The Goldbach Conjecture has, however, been verified to work for numbers up to 4 × 1018 or 4,000,000,000,000,000,000.

Three Primes

Christian Goldbach also made a related conjecture: every integer (odd or even) greater than five is the sum of three primes.

  • 6 = 2 + 2 + 2
  • 11 = 5 + 3 + 3
  • 17 = 5 + 5 + 7

Again, this is strongly believed to be true, but has not been proven yet for all numbers.

Have your students explore these conjectures, looking for evidence that it’s true, or a counter-example that disproves the conjecture.

This is an example of “Get Ridiculous”

Avoid boring examples and go for the outliers! Everything's more interesting when you're working with unexpected examples.

See other examples of “Get Ridiculous” ❯❯




📂 Also filed under Math.

Want to share something?

Everything written here is licensed as CC-BY-SA unless otherwise noted. What does this mean?


Privacy Policy • Disclosure



Copyright © 2009 - 2022 Byrdseed, LLC