Problem 10 - A Gentle Introduction to the Art of Mathematics

Question

Another famous conjecture, also thought to be true \(-\) but as yet unproved, is Goldbach's conjecture. Goldbach's conjecture states that every even number greater than 4 is the sum of two odd primes. There is a function \(g(n),\) known as the Goldbach function, defined on the positive integers, that gives the number of different ways to write a given number as the sum of two odd primes. For example \(g(10)=2\) since \(10=5+5=7+3\). Thus another version of Goldbach's conjecture is that \(g(n)\) is positive whenever \(n\) is an even number greater than \(4 .\) Graph \(g(n)\) for \(6 \leq n \leq 20\)

Step-by-Step Solution

Answer

Graph \(g(n)\) for the values [1, 1, 2, 1, 2, 2, 3, 2].

Step 1: Understand Goldbach's Conjecture and Function

Goldbach's conjecture claims every even number greater than 4 can be expressed as the sum of two odd primes. The Goldbach function, denoted as \(g(n)\), gives the number of different ways to express \(n\) as the sum of two odd primes.

Step 2: Identify Even Numbers

Identify the even numbers between 6 and 20: 6, 8, 10, 12, 14, 16, 18, and 20.

Step 3: Find Odd Primes

List the odd primes less than 20 which can be used to form these sums: 3, 5, 7, 11, 13, 17, and 19.

Step 4: Calculate \(g(n)\) for Each Even Number

For each even number \(n\), calculate \(g(n)\) by finding all unique pairs of odd primes that sum to \(n\). For example, \[ g(6) = 1 \text{ (3+3)} \], \[ g(8) = 1 \text{ (3+5)} \], \[ g(10) = 2 \text{ (3+7, 5+5)} \], and so on.

Step 5: List \(g(n)\) Values

Create a list of \(g(n)\) values for \(n = 6,8,10,12,14,16,18,20\): 6: 1, 8: 1, 10: 2, 12: 1, 14: 2, 16: 2, 18: 3, 20: 2.

Step 6: Graph \(g(n)\)

Plot the values of \(g(n)\) on a graph with \(n\) on the x-axis and \(g(n)\) on the y-axis. Mark points for each \(n\) at its corresponding \(g(n)\) value.

Key Concepts

Even Numbers

An even number is any integer that is divisible by 2 without leaving a remainder. Even numbers are part of our daily lives and appear everywhere. They are essential in various fields, especially in mathematics and computer science. Some examples of even numbers include 2, 4, 6, 8, 10, and so on.

Even numbers can be defined as:

• If you divide any even number by 2, the result will be an integer.
• Even numbers can be both positive and negative, but we often focus on positive even numbers in basic number theory.

For example:

• 6 divided by 2 equals 3 (an integer), so 6 is an even number.
• 22 divided by 2 equals 11 (an integer), making 22 an even number.

In the context of Goldbach's Conjecture, we focus on even numbers greater than 4, like 6, 8, 10, etc. These numbers are interesting because they are supposed to be the sums of two odd primes.

Odd Primes

Prime numbers are numbers greater than 1 that have no divisors other than 1 and themselves. Odd primes are simply prime numbers that are also odd, which means they can't be divided evenly by 2. Odd primes play a critical role in number theory since they appear in various conjectures and theorems, including Goldbach's Conjecture. Examples of odd primes include 3, 5, 7, 11, 13, 17, and 19.

Important properties:

• All prime numbers except for 2 are odd. This is because any even number greater than 2 can be divided by 2, making it non-prime.
• Odd primes are used in determining the sum pairs in Goldbach’s Conjecture.

Let's place some focus on odd primes involved in the Goldbach function from the step-by-step solution:

• When finding pairs that sum to even numbers, you only use odd primes. For example, 3 + 3 = 6 or 5 + 5 = 10.
• The Goldbach function, denoted as g(n), counts how many unique pairs of odd primes sum to an even number n.

Number Theory

Number theory is a branch of pure mathematics that studies the properties and relationships of numbers, particularly integers. It's often referred to as the 'queen of mathematics' due to its foundational role in the field. Number theory encompasses many fascinating concepts, including primes, composites, and various conjectures like Goldbach's.

Key areas include:

• Prime Numbers: Unique for having no divisors other than 1 and themselves. Understanding prime numbers is crucial for deeper insights in number theory.
• Conjectures: Unproved statements that are believed to be true based on empirical evidence. Goldbach's Conjecture is a famous example.
• Functions: Mathematical expressions that define relationships between numbers. The Goldbach function g(n), for instance, counts the ways to write an even number as the sum of two odd primes.

Goldbach's Conjecture falls squarely within number theory and proposes an intriguing idea: every even number greater than 4 can be written as the sum of two odd primes. This conjecture, though unproven, has been tested extensively and holds true for the range of numbers commonly examined. Hence, number theory isn't just theoretical but also has practical computational aspects, making it a captivating area of study.