Breaking an Integer to get Maximum Product
Last Updated :
23 Jul, 2025
Given a number n, the task is to break n in such a way that multiplication of its parts is maximized.
Input : n = 10
Output: 36
Explanation: 10 = 4 + 3 + 3 and 4 * 3 * 3 = 36 is the maximum possible product.
Input: n = 8
Output: 18
Explanation: 8 = 2 + 3 + 3 and 2 * 3 * 3 = 18 is the maximum possible product.
Mathematically, we are given n and we need to maximize a1 * a2 * a3 …. * aK such that n = a1 + a2 + a3 … + aK and a1, a2, ... ak > 0.
Note that we need to break given Integer in at least two parts in this problem for maximizing the product.
Method 1 -
Now we know from maxima-minima concept that, If an integer need to break in two parts, then to maximize their product those part should be equal. Using this concept lets break n into (n/x) x's then their product will be x(n/x), now if we take derivative of this product and make that equal to 0 for maxima, we will get to know that value of x should be e (base of the natural logarithm) for maximum product. As we know that 2 < e < 3, so we should break every Integer into 2 or 3 only for maximum product.
Next thing is 6 = 3 + 3 = 2 + 2 + 2, but 3 * 3 > 2 * 2 * 2, that is every triplet of 2 can be replaced with tuple of 3 for maximum product, so we will keep breaking the number in terms of 3 only, until number remains as 4 or 2, which we will be broken into 2*2 (2*2 > 3*1) and 2 respectively and we will get our maximum product.
In short, procedure to get maximum product is as follows – Try to break integer in power of 3 only and when integer remains small (<5) then use brute force.
The complexity of below program is O(log N), because of repeated squaring power method.
Follow the below steps to implement the above idea:
- Define a function breakInteger that takes an integer N as input and returns the maximum product that can be obtained by breaking N into a sum of positive integers.
- Check for the two base cases:
- If N is 2, return 1.
- If N is 3, return 2.
- Define a variable maxProduct to store the maximum product.
- Determine the remainder of N when divided by 3:
a. If the remainder is 0, the maximum product is 3 raised to the power of N/3.
b. If the remainder is 1, the maximum product is 2 multiplied by 2 multiplied by 3 raised to the power of (N/3)-1.
c. If the remainder is 2, the maximum product is 2 multiplied by 3 raised to the power of N/3. - Return the value of maxProduct.
Below is the implementation of the above approach:
C++
// C/C++ program to find maximum product by breaking
// the Integer
#include <bits/stdc++.h>
using namespace std;
// method return x^a in log(a) time
int power(int x, int a)
{
int res = 1;
while (a) {
if (a & 1)
res = res * x;
x = x * x;
a >>= 1;
}
return res;
}
// Method returns maximum product obtained by
// breaking N
int breakInteger(int N)
{
// base case 2 = 1 + 1
if (N == 2)
return 1;
// base case 3 = 2 + 1
if (N == 3)
return 2;
int maxProduct;
// breaking based on mod with 3
switch (N % 3) {
// If divides evenly, then break into all 3
case 0:
maxProduct = power(3, N / 3);
break;
// If division gives mod as 1, then break as
// 4 + power of 3 for remaining part
case 1:
maxProduct = 2 * 2 * power(3, (N / 3) - 1);
break;
// If division gives mod as 2, then break as
// 2 + power of 3 for remaining part
case 2:
maxProduct = 2 * power(3, N / 3);
break;
}
return maxProduct;
}
// Driver code to test above methods
int main()
{
int maxProduct = breakInteger(10);
cout << maxProduct << endl;
return 0;
}
Java
// Java program to find maximum product by breaking
// the Integer
class GFG {
// method return x^a in log(a) time
static int power(int x, int a)
{
int res = 1;
while (a > 0) {
if ((a & 1) > 0)
res = res * x;
x = x * x;
a >>= 1;
}
return res;
}
// Method returns maximum product obtained by
// breaking N
static int breakInteger(int N)
{
// base case 2 = 1 + 1
if (N == 2)
return 1;
// base case 3 = 2 + 1
if (N == 3)
return 2;
int maxProduct = -1;
// breaking based on mod with 3
switch (N % 3) {
// If divides evenly, then break into all 3
case 0:
maxProduct = power(3, N / 3);
break;
// If division gives mod as 1, then break as
// 4 + power of 3 for remaining part
case 1:
maxProduct = 2 * 2 * power(3, (N / 3) - 1);
break;
// If division gives mod as 2, then break as
// 2 + power of 3 for remaining part
case 2:
maxProduct = 2 * power(3, N / 3);
break;
}
return maxProduct;
}
// Driver code to test above methods
public static void main(String[] args)
{
int maxProduct = breakInteger(10);
System.out.println(maxProduct);
}
}
// This code is contributed by mits
Python3
# Python3 program to find maximum product by breaking
# the Integer
# method return x^a in log(a) time
def power(x, a):
res = 1
while (a):
if (a & 1):
res = res * x
x = x * x
a >>= 1
return res
# Method returns maximum product obtained by
# breaking N
def breakInteger(N):
# base case 2 = 1 + 1
if (N == 2):
return 1
# base case 3 = 2 + 1
if (N == 3):
return 2
maxProduct = 0
# breaking based on mod with 3
if(N % 3 == 0):
# If divides evenly, then break into all 3
maxProduct = power(3, int(N/3))
return maxProduct
elif(N % 3 == 1):
# If division gives mod as 1, then break as
# 4 + power of 3 for remaining part
maxProduct = 2 * 2 * power(3, int(N/3) - 1)
return maxProduct
elif(N % 3 == 2):
# If division gives mod as 2, then break as
# 2 + power of 3 for remaining part
maxProduct = 2 * power(3, int(N/3))
return maxProduct
# Driver code to test above methods
maxProduct = breakInteger(10)
print(maxProduct)
# This code is contributed by mits
C#
// C# program to find maximum product by breaking
// the Integer
class GFG {
// method return x^a in log(a) time
static int power(int x, int a)
{
int res = 1;
while (a > 0) {
if ((a & 1) > 0)
res = res * x;
x = x * x;
a >>= 1;
}
return res;
}
// Method returns maximum product obtained by
// breaking N
static int breakInteger(int N)
{
// base case 2 = 1 + 1
if (N == 2)
return 1;
// base case 3 = 2 + 1
if (N == 3)
return 2;
int maxProduct = -1;
// breaking based on mod with 3
switch (N % 3) {
// If divides evenly, then break into all 3
case 0:
maxProduct = power(3, N / 3);
break;
// If division gives mod as 1, then break as
// 4 + power of 3 for remaining part
case 1:
maxProduct = 2 * 2 * power(3, (N / 3) - 1);
break;
// If division gives mod as 2, then break as
// 2 + power of 3 for remaining part
case 2:
maxProduct = 2 * power(3, N / 3);
break;
}
return maxProduct;
}
// Driver code to test above methods
public static void Main()
{
int maxProduct = breakInteger(10);
System.Console.WriteLine(maxProduct);
}
}
// This code is contributed by mits
JavaScript
<script>
// Javascript program to find maximum
// product by breaking the Integer
// Method return x^a in log(a) time
function power(x, a)
{
let res = 1;
while (a > 0)
{
if ((a & 1) > 0)
res = res * x;
x = x * x;
a >>= 1;
}
return res;
}
// Method returns maximum product obtained by
// breaking N
function breakInteger(N)
{
// Base case 2 = 1 + 1
if (N == 2)
return 1;
// Base case 3 = 2 + 1
if (N == 3)
return 2;
let maxProduct;
// Breaking based on mod with 3
switch (N % 3)
{
// If divides evenly, then break into all 3
case 0:
maxProduct = power(3, N / 3);
break;
// If division gives mod as 1, then break as
// 4 + power of 3 for remaining part
case 1:
maxProduct = 2 * 2 * power(3, (N / 3) - 1);
break;
// If division gives mod as 2, then break as
// 2 + power of 3 for remaining part
case 2:
maxProduct = 2 * power(3, N / 3);
break;
}
return maxProduct;
}
// Driver code
let maxProduct = breakInteger(10);
document.write(maxProduct);
// This code is contributed by rameshtravel07
</script>
PHP
<?php
// PHP program to find maximum product by breaking
// the Integer
// method return x^a in log(a) time
function power($x, $a)
{
$res = 1;
while ($a)
{
if ($a & 1)
$res = $res * $x;
$x = $x * $x;
$a >>= 1;
}
return $res;
}
// Method returns maximum product obtained by
// breaking N
function breakInteger($N)
{
// base case 2 = 1 + 1
if ($N == 2)
return 1;
// base case 3 = 2 + 1
if ($N == 3)
return 2;
$maxProduct=0;
// breaking based on mod with 3
switch ($N % 3)
{
// If divides evenly, then break into all 3
case 0:
$maxProduct = power(3, $N/3);
break;
// If division gives mod as 1, then break as
// 4 + power of 3 for remaining part
case 1:
$maxProduct = 2 * 2 * power(3, ($N/3) - 1);
break;
// If division gives mod as 2, then break as
// 2 + power of 3 for remaining part
case 2:
$maxProduct = 2 * power(3, $N/3);
break;
}
return $maxProduct;
}
// Driver code to test above methods
$maxProduct = breakInteger(10);
echo $maxProduct;
// This code is contributed by mits
?>
Method 2 -
If we see some examples of this problems, we can easily observe following pattern.
The maximum product can be obtained be repeatedly cutting parts of size 3 while size is greater than 4, keeping the last part as size of 2 or 3 or 4. For example, n = 10, the maximum product is obtained by 3, 3, 4. For n = 11, the maximum product is obtained by 3, 3, 3, 2. Following is the implementation of this approach.
C++
#include <iostream>
using namespace std;
/* The main function that returns the max possible product */
int maxProd(int n)
{
// n equals to 2 or 3 must be handled explicitly
if (n == 2 || n == 3) return (n-1);
// Keep removing parts of size 3 while n is greater than 4
int res = 1;
while (n > 4)
{
n -= 3;
res *= 3; // Keep multiplying 3 to res
}
return (n * res); // The last part multiplied by previous parts
}
/* Driver program to test above functions */
int main()
{
cout << "Maximum Product is " << maxProd(45);
return 0;
}
Java
public class GFG
{
/* The main function that returns the max possible product */
static int maxProd(int n)
{
// n equals to 2 or 3 must be handled explicitly
if (n == 2 || n == 3) return (n - 1);
// Keep removing parts of size 3 while n is greater than 4
int res = 1;
while (n > 4)
{
n -= 3;
res *= 3; // Keep multiplying 3 to res
}
return (n * res); // The last part multiplied by previous parts
}
// Driver code
public static void main(String[] args) {
System.out.println("Maximum Product is " + maxProd(45));
}
}
// This code is contributed by divyeshrabadiya07
Python3
''' The main function that returns the max possible product '''
def maxProd(n):
# n equals to 2 or 3 must be handled explicitly
if (n == 2 or n == 3):
return (n - 1)
# Keep removing parts of size 3 while n is greater than 4
res = 1
while (n > 4):
n -= 3
res *= 3 # Keep multiplying 3 to res
return (n * res) # The last part multiplied by previous parts
''' Driver program to test above functions '''
if __name__ == '__main__':
print("Maximum Product is", maxProd(45))
# This code is contributed by rutvik_56.
C#
using System;
class GFG {
/* The main function that returns the max possible product */
static int maxProd(int n)
{
// n equals to 2 or 3 must be handled explicitly
if (n == 2 || n == 3) return (n - 1);
// Keep removing parts of size 3 while n is greater than 4
int res = 1;
while (n > 4)
{
n -= 3;
res *= 3; // Keep multiplying 3 to res
}
return (n * res); // The last part multiplied by previous parts
}
// Driver code
static void Main()
{
Console.WriteLine("Maximum Product is " + maxProd(45));
}
}
// This code is contributed by divyesh072019.
JavaScript
<script>
/* The main function that returns the max possible product */
function maxProd(n)
{
// n equals to 2 or 3 must be handled explicitly
if (n == 2 || n == 3) return (n - 1);
// Keep removing parts of size 3 while n is greater than 4
let res = 1;
while (n > 4)
{
n -= 3;
res *= 3; // Keep multiplying 3 to res
}
return (n * res); // The last part multiplied by previous parts
}
document.write("Maximum Product is " + maxProd(45));
</script>
OutputMaximum Product is 14348907
Time Complexity: O(n)
Auxiliary Space: O(1)
Method 3: (Using Recursion)
Intuition:
Basically in this problem, We have to maximize the product of some integers which sums up to the given integer. Let's take an example of n = 5 and try to solve it. So, we can break 5 to 4,1 or 3,1,1 or 2,1,1,1 or 1,1,1,1,1. We can also break it instead to 3,2 or 1,2,2 or 1,1,1,2 and so on.After taking all these possibilities, [3,2] gives the max product which is 6. Basically we see that our problem is getting divided into subproblems. Thus we can make use of recursion to solve this. Further, if we want to solve for n = 6, we can make use of the previous max product value we got for n = 5 that is 6 to check possibilites for 6, so we can easily do memoization in our recursive solution to reduce our time complexity.
Approach:
The idea is that at every value, we can loop from 1 to n-1 for the first value (a). The remain value (b) has two options:
Keep the same, which means the product will be a * b
Or broken down, which means the product is: a * max(integerBreak(b))
C++
#include <iostream>
using namespace std;
/* The main function that returns the max possible product */
int helper(int n, int idx)
{
//base condition
if(n == 0 or idx == 0) return 1;
//recursive call for each step
if(idx > n) return helper(n, idx - 1);
//return the maximum result obtained from recursive calls
return max((idx * helper(n - idx, idx)), helper(n , idx - 1));
}
//max product function
int maxProd(int n)
{
return helper(n, n - 1);
}
/* Driver program to test above functions */
int main()
{
cout << "Maximum Product is " << maxProd(45);
return 0;
}
Java
public class GFG {
/* The main function that returns the max possible product */
static int helper(int n, int idx) {
// base condition
if (n == 0 || idx == 0)
return 1;
// recursive call for each step
if (idx > n)
return helper(n, idx - 1);
// return the maximum result obtained from recursive calls
return Math.max((idx * helper(n - idx, idx)), helper(n, idx - 1));
}
// max product function
static int maxProd(int n) {
return helper(n, n - 1);
}
/* Driver program to test above functions */
public static void main(String[] args) {
System.out.println("Maximum Product is " + maxProd(45));
}
}
Python3
# Python code for the above approach
# The main function that returns the max possible product
def helper(n, idx):
# Base condition
if n == 0 or idx == 0:
return 1
# Recursive call for each step
if idx > n:
return helper(n, idx - 1)
# Return the maximum result obtained from recursive calls
return max((idx * helper(n - idx, idx)), helper(n, idx - 1))
# Max product function
def maxProd(n):
return helper(n, n - 1)
# Driver program to test above functions
if __name__ == "__main__":
print("Maximum Product is", maxProd(45))
# This code is contributed by Susobhan Akhuli
C#
// C# code for the above approach
using System;
public class GFG {
/* The main function that returns the max possible
* product */
static int Helper(int n, int idx)
{
// base condition
if (n == 0 || idx == 0)
return 1;
// recursive call for each step
if (idx > n)
return Helper(n, idx - 1);
// return the maximum result obtained from recursive
// calls
return Math.Max((idx * Helper(n - idx, idx)),
Helper(n, idx - 1));
}
// max product function
static int MaxProd(int n) { return Helper(n, n - 1); }
/* Driver program to test above functions */
public static void Main(string[] args)
{
Console.WriteLine("Maximum Product is "
+ MaxProd(45));
}
}
// This code is contributed by Susobhan Akhuli
JavaScript
// function to calculate the max product
function helper(n, idx) {
// If n or idx is 0, return 1
if (n === 0 || idx === 0) return 1;
// If idx is > n, recursive call with a smaller idx
if (idx > n) return helper(n, idx - 1);
//return the maximum result obtained from recursive calls
return Math.max(idx * helper(n - idx, idx), helper(n, idx - 1));
}
//max product function
function maxProd(n) {
return helper(n, n - 1);
}
// Driver code
console.log("Maximum Product is " + maxProd(45));
OutputMaximum Product is 14348907
Time Complexity: O(n),fo making the recursive calls.
Auxiliary Space: O(n), recursive stack space
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem