Join TSR now and get all your revision questions answeredSign up now

Counting techniques help Watch

    • Thread Starter


    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:

    f)start with a 3 or end with a 4?

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


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

    Does that help?
Is GoT overrated?
Useful resources

Make your revision easier


Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here


How to use LaTex

Writing equations the easy way

Student revising

Study habits of A* students

Top tips from students who have already aced their exams

Study Planner

Create your own Study Planner

Never miss a deadline again

Polling station sign

Thinking about a maths degree?

Chat with other maths applicants

Can you help? Study help unanswered threads

Groups associated with this forum:

View associated groups

The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

Quick reply
Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.