Mth202 Assignment 4 solution
Thursday, June 16, 2011 Posted In Mth Edit ThisMaximum Marks: 15
Due Date: June 16, 2011
• To solve this assignment, you should have good command over 23 - 30 lectures.
- Try to get the concepts, consolidate your concepts and ideas from these questions which you learn in the 23 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 etc will not be accepted and we will give zero marks correspond to these assignments.
Question 1; Mark: 7
Prove by mathematical induction
for all non-negative integers.Question 2; Marks: 3
Use the Euclidean algorithm to find gcd(430, 174).
Question 3; Marks: 5
A box contains 3 red and 5 black balls; find the total number of ways such that all red balls stay together and all black balls stay together in the row.
Solution:
