let A be a set of 4 digit nos a1,a2,a3,a4 where a1>a2>a3>a4, then n(A) is equal to

Results 1 to 4 of 4

- November 13th 2011, 01:22 AM #1

- Joined
- Feb 2010
- Posts
- 456
- Thanks
- 34

- November 13th 2011, 02:14 AM #2

- Joined
- Aug 2011
- Posts
- 2

## Re: Permu

This can be solved by using combination. Make this a function where X={a1,a2,a3,a4} and Y={0,1,2,...9}. All you have to do is pick 4 numbers from Y. You dont even need to think about the order because the biggest number automatically becomes a1 and the smallest number becomes a4.

- November 13th 2011, 05:00 AM #3

- Joined
- May 2006
- From
- Lexington, MA (USA)
- Posts
- 11,678
- Thanks
- 611

## Re: Permu

Hello, prasum!

Very sloppy wording . . .

composed of the digits

and each digit is used once.

* .The problem said that the 4-digit numbers: .*are*

. . Therefore:. .*(duh!)*

* .If the digits can be repeated:.

Having said all that:.

BTW the inequality was given to indicate that the digits are distinct.

If the digits were or , the answers would "depend".

- November 13th 2011, 05:30 AM #4
## Re: Permu