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, 7 months ago

No vote yet
1 vote


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, 7 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, 7 months ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...