Question

You are given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum 2 product you can get. (Example Input: 10, Output: 36, Explanation: 10 = 3 3 4 = 36). What is your answer for n = 82.

Write a python code for this

Answer 1

import math
# function claculating maximizeProduct
def maximize_Product(num):
   # if num is 2 then 1+1=2 ,result 1*1 =1
   if(num==2):
       return 1;
   # if num is 3 then 2+1=3 ,result 2*1 =2
   if(num==3):
       return 2;
   #if any other number except 1 or 2 or 3
   mProd=0;
   # for breaking in to 3 numbers we using mod 3
   if(num % 3==0):
       mProd = pow(3, int(num/3));
       return mProd;
   elif(num%3==1):
       mProd = 2 * 2 * pow(3, int(num/3) - 1)
       return mProd;
   elif(num%3==2):
       mProd = 2 * pow(3, int(num/3))
       return mProd;
#main program
num=int(input())   
mProduct = maximize_Product(num)
print("product : ", mProduct)