MCS-177, Intro. to Computer Science I, Fall 2002
Homework Chapter 4 Make-up problems
Due:Wednesday, Oct. 30
- (10 points)
Use induction to prove that the version of mod-expt on page 93
of the text does at most e multiplications when e > 0. Note
that the code actually does much better than this.
- (15 points)
Do exercise 4.18 on page 104. Part a is worth 8 points, point b is
worth 7 points.
MCS 177 homepage