Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Suppose that f(n)=f(n/5)+3n2whenn is a positive integer divisible by 5 , and f(1)=4. Find

Short Answer

Expert verified

The answers are given below;

a)\(f\left( 5 \right) = 79\)

b)\(f\left( {125} \right) = 48,829\)

c) \(f\left( {3125} \right) = 30,517,579\)

Step by step solution

01

Recurrence Relation definition

A recurrence relation is an equation that recursively defines a sequence where the next term is a function of the previous terms:f(n) = a f(n / b) + c

02

Apply Recurrence Relation

Compute these from the bottom up.

a) Repeatedly apply the recurrence relation

\(\begin{aligned}f(5) &= f(1) + 3 \times {5^2}\\& = 4 + 75\\ &= 79\end{aligned}\)

b) Repeatedly apply the recurrence relation

\(\begin{aligned}f(25) &= f(5) + 3 \times {25^2} + 46875\\ &= 79 + 1875 + 46875\\& = 1954\\f(125) &= f(25) + 3 \times {125^2} + 46875\\ &= 1954 + 46875\\ &= 48,829\end{aligned}\)

c) Repeatedly apply the recurrence relation

\(\begin{aligned}f(625) &= f(125) + 3 \times {625^2}\\ &= 48829 + 1171875\\& = 1220704\\f(3125) &= f(625) + 3 \times {3125^2}\\ &= 1220704 + 29296875\\ &= 30,517,579\end{aligned}\)

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Study anywhere. Anytime. Across all devices.

Sign-up for free