Waste less time on Facebook — follow Brilliant.
×

Number Theory : Proof Problem

Prove that every natural number greater than or equal to 12 is the sum of two composite numbers. This proof is eating my mind. Please solve!

Note by Swapnil Das
2 years, 10 months ago

No vote yet
1 vote

  Easy Math Editor

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 \( 2 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

Sort by:

Top Newest

Consider \( (9,(n-9)) \) and \( (8,(n-8)) \). Of these two pairs, at least one pair must consist of two composite numbers, why?

Siddhartha Srivastava - 2 years, 10 months ago

Log in to reply

If you want a lengthy proof , try using Chicken McNugget Theorem on multiple pairs of numbers .

Azhaghu Roopesh M - 2 years, 10 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...