By considering the terms in the Fibonacci sequence whose values do not exceed fo

Question

By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms. The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143? A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 times 99. Find the largest palindrome made from the product of two 3-digit numbers. 2520 is the smallest number that can be divided b, each of the numbers from 1 to without any remainder. What is the smallest positive number that is evenly divisible by all of the number

Explanation / Answer

Problem 3:

Largest prime factor of 600851475143= 6857

it was obtained by the code given below

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {
   int T;
   scanf("%d", &T);
   while (T--) {
       long long N;
       scanf("%lld", &N);
       long long p = 1, f;
       for (f = 2; f*f <= N; ++f) {
           while (N % f == 0) {
               p = f;
               N /= f;
           }
       }
       if (N > 1) p = N;
       printf("%lld ", p);
   }
  
return 0;
}

input:

1
600851475143

Output:

6857.

Problem 4:

Largest palindrome product for 3 digit will be 993*913 = 906609

Related Questions

Navigate

• Browse (All)
• Browse B
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.