Create a test case for Euler problem 3:
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ?
Solution
#include
#include
// function to print all prime factors for a given number.
int primFact(long int n,int* arr)
{
long int i;
int j=0;
// Print the number of 2s that divide n
while (n%2 == 0)
{
arr[j++] = 2;
n = n/2;
}
// n must be odd at this point. So we can skip one element (Note i = i +2)
for (i = 3; i <= sqrt(n); i = i+2)
{
// While i divides n, print i and divide n
while (n%i == 0)
{
arr[j++] = i;
n = n/i;
}
}
/*
handle prime numbers;
*/
if (n > 2){
arr[j++] = n;
}
return j;
}
/* main function to test the prime factors functions.*/
int main()
{
long int n = 600851475143;
int arr[100];
int len = primFact(n,&arr[0]);
int i;
int max = arr[0];
for(i=1;i.
Create a test case for Euler problem 3The prime factors of 13195 .pdf
1. Create a test case for Euler problem 3:
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ?
Solution
#include
#include
// function to print all prime factors for a given number.
int primFact(long int n,int* arr)
{
long int i;
int j=0;
// Print the number of 2s that divide n
while (n%2 == 0)
{
arr[j++] = 2;
n = n/2;
}
// n must be odd at this point. So we can skip one element (Note i = i +2)
for (i = 3; i <= sqrt(n); i = i+2)
{
// While i divides n, print i and divide n
while (n%i == 0)
{
arr[j++] = i;
n = n/i;
}
}
/*
handle prime numbers;
*/
if (n > 2){
arr[j++] = n;
}
2. return j;
}
/* main function to test the prime factors functions.*/
int main()
{
long int n = 600851475143;
int arr[100];
int len = primFact(n,&arr[0]);
int i;
int max = arr[0];
for(i=1;i
![Create a test case for Euler problem 3:
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ?
Solution
#include
#include
// function to print all prime factors for a given number.
int primFact(long int n,int* arr)
{
long int i;
int j=0;
// Print the number of 2s that divide n
while (n%2 == 0)
{
arr[j++] = 2;
n = n/2;
}
// n must be odd at this point. So we can skip one element (Note i = i +2)
for (i = 3; i <= sqrt(n); i = i+2)
{
// While i divides n, print i and divide n
while (n%i == 0)
{
arr[j++] = i;
n = n/i;
}
}
/*
handle prime numbers;
*/
if (n > 2){
arr[j++] = n;
}](https://image.slidesharecdn.com/createatestcaseforeulerproblem3theprimefactorsof13195-230705101625-ed71bbc4/85/Create-a-test-case-for-Euler-problem-3The-prime-factors-of-13195-pdf-1-320.jpg)
![return j;
}
/* main function to test the prime factors functions.*/
int main()
{
long int n = 600851475143;
int arr[100];
int len = primFact(n,&arr[0]);
int i;
int max = arr[0];
for(i=1;i](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)