Given a positive integer . The task is to represent it as a sum of the maximum possible number of prime numbers. (N > 1)

**Examples**:

Input : N = 5 Output : 2 3 Input : N = 6 Output : 2 2 2

At first, the problem might seem to involve some use of Goldbach’s conjecture. But the key observation here is to maximise the number of terms used, you should use as small numbers as possible. This leads to the following idea:

- If N is even, it can be represented as sum of two’s.
- Otherwise, has to be even and hence N can be represented as sum of one 3 and two’s.

This is the maximum number of primes whose sum is N.

Below is the implementation of the above approach:

## C++

`// CPP program to represent a number as a ` `// sum of maximum possible number of ` `// Prime Numbers ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to represent a number as a ` `// sum of the maximum possible number ` `// of Prime Numbers ` `void` `printAsMaximalPrimeSum(` `int` `n) ` `{ ` ` ` `// If n is odd, print one 3 ` ` ` `if` `(n % 2 == 1) { ` ` ` `cout << ` `"3 "` `; ` ` ` `n -= 3; ` ` ` `} ` ` ` ` ` `// Now n is even, print 2 n/2 times ` ` ` `while` `(n) { ` ` ` `cout << ` `"2 "` `; ` ` ` `n -= 2; ` ` ` `} ` `} ` ` ` `// Driver Code ` `int` `main() ` `{ ` ` ` `int` `n = 5; ` ` ` `printAsMaximalPrimeSum(n); ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to represent a number as a ` `// sum of maximum possible number of ` `// Prime Numbers ` ` ` `import` `java.io.*; ` ` ` `class` `GFG { ` ` ` `// Function to represent a number as a ` `// sum of the maximum possible number ` `// of Prime Numbers ` `static` `void` `printAsMaximalPrimeSum(` `int` `n) ` `{ ` ` ` `// If n is odd, print one 3 ` ` ` `if` `(n % ` `2` `== ` `1` `) { ` ` ` `System.out.print( ` `"3 "` `); ` ` ` `n -= ` `3` `; ` ` ` `} ` ` ` ` ` `// Now n is even, print 2 n/2 times ` ` ` `while` `(n>` `0` `) { ` ` ` `System.out.print( ` `"2 "` `); ` ` ` `n -= ` `2` `; ` ` ` `} ` `} ` ` ` ` ` `// Driver Code ` ` ` `public` `static` `void` `main (String[] args) { ` ` ` `int` `n = ` `5` `; ` ` ` `printAsMaximalPrimeSum(n); ` ` ` `} ` `} ` ` ` `// This Code is contributed by inder_verma.. ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 program to represent a number as a ` `# sum of maximum possible number of ` `# Prime Numbers ` ` ` ` ` `# Function to represent a number as a ` `# sum of the maximum possible number ` `# of Prime Numbers ` `def` `printAsMaximalPrimeSum( n): ` ` ` ` ` `# If n is odd, print one 3 ` ` ` `if` `( n ` `%` `2` `=` `=` `1` `): ` ` ` `print` `(` `"3 "` `,end` `=` `"") ` ` ` `n ` `-` `=` `3` ` ` ` ` ` ` `# Now n is even, print 2 n/2 times ` ` ` `while` `( n>` `0` `): ` ` ` `print` `(` `"2 "` `,end` `=` `"") ` ` ` `n ` `-` `=` `2` ` ` ` ` ` ` `# Driver Code ` ` ` `n ` `=` `5` `printAsMaximalPrimeSum( n) ` ` ` `# This code is contributed by ihritik ` |

*chevron_right*

*filter_none*

## C#

`// C# program to represent a number as a ` `// sum of maximum possible number of ` `// Prime Numbers ` ` ` ` ` `using` `System; ` `class` `GFG ` `{ ` ` ` `// Function to represent a number as a ` ` ` `// sum of the maximum possible number ` ` ` `// of Prime Numbers ` ` ` `static` `void` `printAsMaximalPrimeSum(` `int` `n) ` ` ` `{ ` ` ` `// If n is odd, print one 3 ` ` ` `if` `(n % 2 == 1) { ` ` ` `Console.Write(` `"3 "` `); ` ` ` `n -= 3; ` ` ` `} ` ` ` ` ` `// Now n is even, print 2 n/2 times ` ` ` `while` `(n>0) { ` ` ` `Console.Write(` `"2 "` `); ` ` ` `n -= 2; ` ` ` `} ` ` ` `} ` ` ` ` ` `// Driver Code ` ` ` `public` `static` `void` `Main() ` ` ` `{ ` ` ` `int` `n = 5; ` ` ` `printAsMaximalPrimeSum(n); ` ` ` `} ` ` ` `} ` ` ` `// This code is contributed by ihritik ` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP program to represent a number as a ` `// sum of maximum possible number of ` `// Prime Numbers ` ` ` ` ` `// Function to represent a number as a ` `// sum of the maximum possible number ` `// of Prime Numbers ` `function` `printAsMaximalPrimeSum(` `$n` `) ` `{ ` ` ` `// If n is odd, print one 3 ` ` ` `if` `(` `$n` `% 2 == 1) { ` ` ` `echo` `"3 "` `; ` ` ` `$n` `-= 3; ` ` ` `} ` ` ` ` ` `// Now n is even, print 2 n/2 times ` ` ` `while` `(` `$n` `>0) { ` ` ` `echo` `"2 "` `; ` ` ` `$n` `-= 2; ` ` ` `} ` `} ` ` ` `// Driver Code ` ` ` `$n` `= 5; ` `printAsMaximalPrimeSum(` `$n` `); ` ` ` ` ` `// This code is contributed by ihritik ` `?> ` |

*chevron_right*

*filter_none*

**Output:**

3 2

**Time Complexity: ** O(N)

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.

## Recommended Posts:

- Count of ways to represent N as sum of a prime number and twice of a square
- Number which has the maximum number of distinct prime factors in the range M to N
- Print the nearest prime number formed by adding prime numbers to N
- Check if a number is Prime, Semi-Prime or Composite for very large numbers
- Check if a prime number can be expressed as sum of two Prime Numbers
- Number of distinct ways to represent a number as sum of K unique primes
- Find prime number K in an array such that (A[i] % K) is maximum
- Largest number in [2, 3, .. n] which is co-prime with numbers in [2, 3, .. m]
- Express an odd number as sum of prime numbers
- Sum of Maximum and Minimum prime factor of every number in the Array
- New Algorithm to Generate Prime Numbers from 1 to Nth Number
- Check if a number can be written as a sum of 'k' prime numbers
- Find all the prime numbers of given number of digits
- Find a sequence of N prime numbers whose sum is a composite number
- Maximum number of prime factors a number can have with exactly x factors
- Number of factors of very large number N modulo M where M is any prime number
- Find the minimum number to be added to N to make it a prime number
- Sum of all the prime numbers with the maximum position of set bit ≤ D
- Count of prime digits of a Number which divides the number
- Minimum and Maximum prime numbers in 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 contribute@geeksforgeeks.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.