MTH202 Discrete Mathematics Assignment no 3 idea solution Spring 2011

**Vuhelper** · 05-05-2011, 12:13 AM

View more random threads:

Due Date: May 27, 2011

Question 1; Mark: 5
Let be defined as
Check whether is bijective function or not?

Sponsored Links

Question 2; Marks: 5
Let be defined as

Show that and are inverse of each other.
Question 3; Marks: 5

Find the sum of the following series.
i)
ii)

**sumaira kharal** · 05-24-2011, 02:09 AM

ausslam alaikum sir g i am sumaira kharal. mcs 2nd semester hae
sir g i am so worried about cs subjects pls help me and guide me pls i request u.

sana.pari · 05-24-2011, 11:48 AM

hheheh

aur karo use jazz appna hai

**ironwood** · 05-25-2011, 04:55 AM

**shafiq856** · 05-25-2011, 10:38 PM

**shafiq856** · 05-25-2011, 10:50 PM

MTH202 Assignment No.3 Idea Solution

**Vuhelper** · 05-25-2011, 11:31 PM

yah tu lms say copy keya hai app nay

**adeela sharjil** · 01-05-2012, 03:47 PM

yah ha bhi galt hamri assignment hi or ha.........................

**Vuhelper** · 01-05-2012, 04:21 PM

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?

Answer.
The number of the possible path between the cities is the number of the permutations of seven elements because the first city is determined but remaining 7 can be ordered arbitrarily. Hence

7!=7*6*5*4*3*2*1=5040
So the possible paths are 5040

**Vuhelper** · 01-05-2012, 04:21 PM

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

Answer
1- Divide 9993 by 93= 93x107+42
2- Divide 93 by 42= 42x2+9
3- Divide 42 by 9=9x4+6
4- Divide 9 by 6=6x1+3
5- Divide 6 by 3=3x2+0
Hence gcd of(9993,93) is 3

Thread: MTH202 Discrete Mathematics Assignment no 3 idea solution Spring 2011

Thread Tools

Display