/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q14E Suppose you want to compute the ... [FREE SOLUTION] | 91影视

91影视

Log out

Learning Materials

Features

Discover

Chapter 1: Q14E (page 49)

Suppose you want to compute the nth Fibonacci number Fn , modulo an integer p. Can you find an efficient way to do this?

Short Answer

Expert verified

The final running time after computing each step of fib3is O(log(n)*M(logp)).

Step by step solution

01

Introduction

Fibonacci Series 鈥� This series can be defined as every element of the series is the sum of two previous number of the series. Series will start from 0and1.

02

nth Fibonacci number formulae

Matrix multiplication for nthFibonacci number is

FnFn+1=0111nF0F1

Let鈥檚 assume that the running time for multiplying matrix of n-bit numbers is x(n).

By problem0.4,fib3 involvesO(logn) arithmetic operations for multiplication.

So,

For every arithmetic operation with modp, then the answer of the final step is long aslogp bits.

Therefore, the final running time after computing each step offib3 is O(log(n)*M(logp)).

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 91影视!

One App. One Place for Learning.

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

Get started for free

Most popular questions from this chapter

Consider an RSA key set with p = 17 , q = 23, N = 23 and e = 3 (as in Figure 1.9). What value of d should be used for the secret key? What is the encryption of the message M = 41 ?

Give a polynomial-time algorithm for computing,abcmodp given a,b,c, and prime p.

The algorithm for computing abmodCby repeated squaring does not necessarily lead to the minimum number of multiplications. Give an example of b>10where the exponentiation can be performed using fewer multiplications, by some other method.

Calculate 2125mod127using any method you choose. (Hint: 127 is prime.)

Is the difference of 530,000and6123,456a multiple of31 ?
See all solutions

Recommended explanations on Computer Science Textbooks

Game Design in Computer Science

Read Explanation

Functional Programming

Read Explanation

Theory of Computation

Read Explanation

Data Representation in Computer Science

Read Explanation

Blockchain Technology

Read Explanation

Databases

Read Explanation
View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.