Given an odd number N, the task is to find if the number can be represented as the sum of 3 prime numbers.
Input: N = 7 Output: Yes Explanation: 2 + 2 + 3 = 7 Input: N = 17 Output: Yes Explanation: 2 + 2 + 13 = 17
In number theory, Goldbach’s weak conjecture, also known as the odd Goldbach conjecture, the ternary Goldbach problem, or the 3-primes problem, states that Every odd number greater than 5 can be expressed as the sum of three primes. (A prime may be used more than once in the same sum.).
Below is the implementation of the above approach:
- Triangle of numbers arising from Gilbreath's conjecture
- Legendre's Conjecture
- Lemoine's Conjecture
- Ramanujan–Nagell Conjecture
- Program to implement Collatz Conjecture
- Program for Goldbach’s Conjecture (Two Primes with given Sum)
- Maximum Sequence Length | Collatz Conjecture
- Permutation of numbers such that sum of two consecutive numbers is a perfect square
- Print N lines of 4 numbers such that every pair among 4 numbers has a GCD K
- Numbers within a range that can be expressed as power of two numbers
- Numbers less than N which are product of exactly two distinct prime numbers
- Count numbers which are divisible by all the numbers from 2 to 10
- Count numbers which can be constructed using two numbers
- Maximum sum of distinct numbers such that LCM of these numbers is N
- Absolute difference between the Product of Non-Prime numbers and Prime numbers of an Array
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.