How to find maximum product of two prime numbers in an array ?

radha gogia

New Member

Join Date: Feb 2015

Posts: 56
#1

How to find maximum product of two prime numbers in an array ?

Sep 1 '16, 05:00 PM

I have already posted this question on stackoverflow but still I couldn't get my doubt clarified , my code is not working on 1st and 3rd input ,please clarify this .

How to find the maximum product of two prime numbers in an array?

http://stackoverflow.com/questions/39262644/how-to-find-the-maximum-product-of-two-prime-numbers-in-an-array/39262723?

#include <stdio.h> int final[3]; int checkprime(int n,int loopcount) { int flag=0,m; for(m=2; m<=loopcount; m++) { if(n%m==0 && n!=2) { flag...
Tags: None
weaknessforcats

Recognized Expert Expert

Join Date: Mar 2007

Posts: 9214
#2

Sep 1 '16, 10:14 PM

Forget about prime numbers. Write a function that returns the maximum product of any two members of your array.

Then modify the function so that only members with prime numbers are multiplied.

And you are done.
Comment

Comment