Back to all chapters
# Permutations

As head of Brilliant's cybersecurity, you need to know how many different passwords can be created by rearranging the digits 1, 2, 3, 4, 5, and 6. Can you count them all?

How many 5 digit numbers can be formed if *either*

(a) every successive digit exceeds its predecessor,
*or*

(b) every successive digit is smaller than its predecessor.

Detail: Leading 0's don't count, aka 04521 is not a 5-digit number.

Note: If the probability is 1%, enter it as 0.01.

\[\huge INTERMEDIATE\] How many words can be made with the letters of the word \(INTERMEDIATE\) if the order of vowels doesn't change ?

The "order of the vowels" refers to the sequence in which they occur. IE the sequence should be \( I - E - E - I - A - E \).

×

Problem Loading...

Note Loading...

Set Loading...