Q3 alt.cpp

#include <iostream>
#include<math.h>
using namespace std;
void primeFactors(long long n)
{
     while (n % 2 == 0)
    {
        cout << 2 << " ";
        n = n/2;
    }
     for (int i = 3; i <= sqrt(n); i = i + 2)
    {
            while (n % i == 0)
        {
            cout << i << " ";
            n = n/i;
        }
    }
      if (n > 2)
        cout << n << " ";

        cout<<"The largest PM is "<< n ;
}


int main()
{
    long long num = 600851475143;
    primeFactors(num);
    return 0;
}