Harder 3u/probability (1 Viewer)

duy.le

Member
Joined
Feb 15, 2007
Messages
137
Gender
Male
HSC
2008
ii), iv) and vi) are really freaken hard.

i did this under exam conditions and simply gave up on those, simply for the pure ownage people to do (while under exam conditions). i have the answers to that some where...LOl sorry cbb find them.
 

Affinity

Active Member
Joined
Jun 9, 2003
Messages
2,064
Location
Oslo
Gender
Undisclosed
HSC
2003
i. easy
ii.slightly sneaky argument. L_{k+1} has to go in one of the first k envelopes. suppose it goes into E_{n}. Then you are left with k letters and k envelopes..
Then you break it up into 2 cases..
a) L_{n} goes into E_{k+1}
b) L_{n} doesn't go into E_{k+1}
the first case (a) gives u_{k-1} since you are left with k-1 letters in k-1 envelopes. for the 2nd case (b) you can imagine E_{k+1} being 'relabeled' E_{n}, and you are essentially trying to place k letters into k envelopes, so that you don't get any correctly placed.

so you get U_{k+1} = k(U_{k} + U_{k-1})

iii. you can do this.
iv. shouldn't be too hard, alternatively you can use the inclusion exclusion principle
v. a) easy b) should be easy too c.) (5choose 3)u_3 / 120
vi. following the patter (n choose k) u_{k} would represent the number of permutations where there is something misplaced. out of the n! permutations only 1 is perfect.. so it follows that the sum is n!-1

Search up matching problem on google (the wiki article is a related problem in graph theory though)
 

duy.le

Member
Joined
Feb 15, 2007
Messages
137
Gender
Male
HSC
2008
affinity dont take this personally but what did u get in maths/hsc?

by no means do u have to reply.
 

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top