You are Here: Home >< Maths

# Counting techniques help

1. Hello,

Can someone please explain to me how this concept works and how it applies to this question:

n(AuB) = n(A) + n(B) - n(AuB)

The question:

How many three digit codes can be made using the digits 0,1,2,3,4,5 if there are no restrictions on using a digit more than once?

How many of these codes:

My solution:

1x6x6 + 6x6x1 - (1x6x1) ---> answer is correct but i dont understand the n(AuB) part so please can you help me, i understand that the events are mutually exclusive so yeah..

Thanks
2. Let A = start with 3, B = end with 4
n(AuB) = n(A) + n(B) - n(AnB).

Does that help?

## Register

Thanks for posting! You just need to create an account in order to submit the post
1. this can't be left blank
2. this can't be left blank
3. this can't be left blank

6 characters or longer with both numbers and letters is safer

4. this can't be left empty
1. Oops, you need to agree to our Ts&Cs to register

Updated: April 1, 2012
TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Today on TSR

### Is this true about Oxbridge?

Should I still go?

Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams