Question

Given a number n, write a program to find the sum of the largest prime factors of each of nine consecutive numbers starting from n. G(n) = f(n) + f(n+1) + f(n+2) + f(n+3) + f(n+4) + f(n+5) + f(n+6) + f(n+7) + f(n+8) where, g(n) is the sum and f(n) is the largest prime factor of n for example, g(10)=f(10)+f(11)+f(12)+f(13)+f(14)+f(15)+f(16)+f(17)+f(18) =5 + 11 + 3 + 13 + 7 + 5 + 2 + 17 + 3 =66

Answer 1

Step-by-step explanation:

Method 1: Using Slope Intercept Form

Substitute the slope from original line (3 in this case) into the equation of the line y = 3x + b.

Substitute the given point (1,7) into the x and y values 7 = 3(1) + b.

Solve for b (the y-intercept)

Substitute this value for 'b' in the slope intercept form equation y = 3x + 4.