Sponsored Links


Page 1 of 2 12 LastLast
Results 1 to 10 of 13

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

  1. #1
    Administrator Vuhelper's Avatar
    Join Date
    Apr 2011
    Posts
    9,578

    NEW MTH202 Discrete Mathematics Assignment no 3 idea solution Spring 2011

    Sponsored Links1



  2. #2
    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.

  3. #3
    sana.pari
    Guest

    Icon14

    hheheh
    aur karo use jazz appna hai

  4. #4
    Junior Member ironwood's Avatar
    Join Date
    Jan 2011
    Location
    Faisalabad.
    Posts
    17

    solution?


  5. #5
    Junior Member shafiq856's Avatar
    Join Date
    Jul 2010
    Location
    Muzaffargarh
    Posts
    14

    MTH202 Assign3


  6. #6
    Junior Member shafiq856's Avatar
    Join Date
    Jul 2010
    Location
    Muzaffargarh
    Posts
    14

    MTH202 Assignment No.3 Idea Solution

    MTH202 Assignment No.3 Idea Solution
    Attached Files Attached Files

  7. #7
    Administrator Vuhelper's Avatar
    Join Date
    Apr 2011
    Posts
    9,578
    yah tu lms say copy keya hai app nay

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

  9. #9
    Administrator Vuhelper's Avatar
    Join Date
    Apr 2011
    Posts
    9,578
    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


  10. #10
    Administrator Vuhelper's Avatar
    Join Date
    Apr 2011
    Posts
    9,578

    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

Page 1 of 2 12 LastLast

Thread Information

Users Browsing this Thread

There are currently 1 users browsing this thread. (0 members and 1 guests)

Similar Threads

  1. Replies: 0
    Last Post: 05-07-2013, 04:24 PM
  2. Replies: 0
    Last Post: 04-19-2013, 10:18 PM
  3. Replies: 39
    Last Post: 11-01-2011, 02:01 AM
  4. Replies: 0
    Last Post: 06-12-2011, 03:29 AM
  5. Replies: 13
    Last Post: 04-16-2011, 01:43 AM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  
-: Vuhelp Disclaimer :-
None of the files shown here are hosted or transmitted by this server. The links are provided solely by this site's users. The administrator's or staff of Vuhelp.net cannot be held responsible for what its users post, or any other actions of its users. You may not use this site to distribute or download any material when you do not have the legal rights to do so. It is your own responsibility to adhere to these terms. If you have any doubts about legality of content or you have any suspicions, feel free to contact us.
Online Education | JhelumSoft | Jobs