Scribd Logo
Upload

Welcome to Scribd!

  • 4 views

    Permutations-Miranda R.12b

    Uploaded by

    joe mama
    This document provides examples of calculating permutations. Permutations refer to the number of ways objects can be arranged or selected without repetition and order matters. The three examples are: 1) 9!=362,880 ways to arrange 9 objects, 2) 10P4=5040 ways to select 4 objects from 10 without replacement, and 3) 26P4=358800 ways to create a password with 4 letters selected from 26 letters of the alphabet.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Permutations-Miranda R.12b

    Uploaded by

    joe mama
    4 views2 pages
    This document provides examples of calculating permutations. Permutations refer to the number of ways objects can be arranged or selected without repetition and order matters. The three examples are: 1) 9!=362,880 ways to arrange 9 objects, 2) 10P4=5040 ways to select 4 objects from 10 without replacement, and 3) 26P4=358800 ways to create a password with 4 letters selected from 26 letters of the alphabet.

    Original Description:

    Original Title

    Permutations-Miranda R.12b (2)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides examples of calculating permutations. Permutations refer to the number of ways objects can be arranged or selected without repetition and order matters. The three examples are: 1) 9!=362,880 ways to arrange 9 objects, 2) 10P4=5040 ways to select 4 objects from 10 without replacement, and 3) 26P4=358800 ways to create a password with 4 letters selected from 26 letters of the alphabet.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    4 views2 pages

    Permutations-Miranda R.12b

    Uploaded by

    joe mama
    This document provides examples of calculating permutations. Permutations refer to the number of ways objects can be arranged or selected without repetition and order matters. The three examples are: 1) 9!=362,880 ways to arrange 9 objects, 2) 10P4=5040 ways to select 4 objects from 10 without replacement, and 3) 26P4=358800 ways to create a password with 4 letters selected from 26 letters of the alphabet.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    Permutations

    Practice Problems

    9!=362,880

    10P4= 10! = 10! =5040


    (10-4)! 6!

    8P3= 8! =336
    (8-3)!

    43P3= 40! =74,046


    (43-3)!

    12P4= 12! =11,880


    (12-4)!
    9! 9! 16! = 16! = 240
    =
    (9-5)! 4! = 15,120 (16-2)! 14!
    7! = 7! = 840
    (7-4)! 3!

    6! = 6! 30
    =
    (6-2)! 4! 30 = 0.03
    11! =11! = 990 990
    (11-3)! 8!

    10P4 = 10! = 10!= 5040 -It is a permutation because it is asking for the number of ways there could be.
    (10-4)! 6!

    28! = 756
    28P2 = 28! = Permutation because it is asking the different ways 2 captains can be chosen.
    (28-1)! 26!

    26P4 = 26 = 26! = 358800 Permutation because it is asking for how many passwords can be created.
    (26-4)! 22!

    You might also like