Given a positive integer N greater than 1, the task is to find the minimum count of Prime Numbers whose sum is equal to given N.
Input: N = 100
100 can be written as sum of 2 prime numbers 97 and 3.
Input: N = 25
25 can be written as sum of 3 prime numbers 11, 11, and 3.
For the minimum number of primes whose sum is the given number N, Prime Numbers must be as large as possible. Following are the observation for the above problem statement:
- Case 1: If the number is prime, then the minimum primes numbers required to make sum N is 1.
- Case 2: If the number is even, then it can be expressed as a sum of two primes as per the Goldbach’s Conjecture for every even integer greater than 2. Therefore the minimum prime number required to make the sum N is 2.
- Case 3: If the number is odd:
- If (N-2) is prime, then the minimum prime number required to make the given sum N is 2.
- Else The minimum prime numbers required to make the given sum N is 3 because:
As N is odd, then (N - 3) is even. Hence As per case 2: The minimum prime number required to make the sum (N-3) is 2. Therefore, The minimum prime number required to make the sum N is 3(2+1).
Below are the steps:
- Check whether the given number N is prime or not, by using the approach discussed in this article. If Yes then print 1.
- Else as per the above Cases print the minimum number of Prime Numbers required to make the given sum N.
Below is the implementation of the above approach:
Time Complexity: O(√N), where N is the given number.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Minimum number of single digit primes required whose sum is equal to N
- Minimum operations required to convert X to Y by multiplying X with the given co-primes
- Find the minimum number of operations required to make all array elements equal
- Minimum number of cuts required to make circle segments equal sized
- Minimum changes required to make all element in an array equal
- Minimum operations required to make two numbers equal
- Minimum deletions required to make GCD of the array equal to 1
- Minimum cuts required to divide the Circle into equal parts
- Minimum operations required to make all the array elements equal
- Minimum flips required to convert given string into concatenation of equal substrings of length K
- Minimum number of distinct powers of 2 required to express a given binary number
- Minimum number of swaps required to make a number divisible by 60
- Minimum number of given powers of 2 required to represent a number
- Minimum number of palindromes required to express N as a sum | Set 2
- Minimum number of integers required such that each Segment contains at least one of them
- Minimum number of given operation required to convert n to m
- Minimum number of palindromes required to express N as a sum | Set 1
- Minimum number operations required to convert n to m | Set-2
- Minimum number of operations required to reduce N to 1
- Minimum number of changes required to make the given array an AP
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.