MTH202 Assignment No 3 Solution & Discussion Fall 2011

Assignment No. 3 Of MTH202 (Fall 2011)

                                                                                              Maximum Marks: 20                                                                                      

                                                                                                     Due Date: Jan 05, 2012

DON’T MISS THESE: Important instructions before attempting the solution of this assignment:

• Don’t miss any step to get full marks.
• To solve this assignment, you should have good command over 21 - 30 lectures.
• Try to get the concepts, consolidate your concepts and ideas from these questions which you learn in the 21 to 30 lectures.
• Upload assignments properly through LMS, No Assignment will be accepted through email.
• Write your ID on the top of your solution file.
• Don’t use colorful back grounds in your solution files.
• Use Math Type or Equation Editor etc for mathematical symbols.
• You should remember that if we found the solution files of some students are same then we will reward zero marks to all those students.
• Try to make solution by yourself and protect your work from other students, otherwise you and the student who send same solution file as you will be given zero marks.
• Also remember that you are supposed to submit your assignment in Word format any other like scan images, PDF etc will not be accepted and we will give zero marks correspond to these assignments.

Question 1                                                                                                            Marks 05

 If f is defined recursively by

  and

then find  f(4) ?   

                                                                 

Question 2                                                                                                            Marks 05

Prove using mathematical induction (Prove only Inductive Step) that

Question 3                                                                                                             Marks 05

Use the Euclidean algorithm to find gcd (9993, 93).

Question 4                                                                                                            Marks 05

Suppose that a saleswoman has to visit eight different cities. She must begin her trip in a specific city, but she can visit the other seven cities in any order she wishes. How many possible orders can the saleswoman use when visiting these cities?