BoS Maths Trials 2019 (1 Viewer)

[InteGrand]

Thanks, but i think this is way over the top for 4unit.
I saw a way a teacher did it through binary. The analogy goes something like this:

1 0 1 1 1 1 0 0 0 is a binary string of length 10. In a binary string of length 50, how many ways are there to have a string with exactly nine lots of ones and that no ones are next to each other?

I fail to see how these two are the same question/where is the one-to-one correspondence.
Maybe trebla can help?

I got 42C9 using the method I posted above, so I assumed there was a simpler method.

For the equivalence between the method your teacher used and the original question, it is as follows:

The bit string of length 50 corresponds to your choice of whether you pick each number from 1-50 or not. A bit of 0 in the string means you did NOT pick that number, and a bit of 1 means you picked that number.

For example, (assume you're picking 3 numbers from a 1-10 for simplicity here): 1001000100 has a 1 in positions 1, 4, 8, so it corresponds to picking 1, 4 and 8.

The original question is then like counting bit strings of length 50 (since we pick from numbers 1-50) with 9 1's (since we pick a total of 9 numbers), and no two 1's can be adjacent (since that represents picking two consecutive numbers).

 

[blyatman]

I have a feeling this is HscBuzman on an alt acc or something. What do you guys think? @blyatman @jazz519 .

Dunno, doubt it based on account creation date. Also the response post to the question doesn't really make any sense, sounds more like a joke so I don't think it was intended to be rude. Either way, I'll give them the benefit of the doubt. and assume we've all moved past it. Besides, too busy to think about stuff like this lol.

 

[aa180]

So obviously the answer is 42C9

My formula gives 42C9 exactly, but you originally told me that the answer was 42C7

 

[InteGrand]

So obviously the answer is 42C9

Why is it obviously 42C9?



I assume the intended solution was simple.

 

[worldno17]

As a quick warm up for tomorrow, can anyone answer with reasons
Given 50 cards with the integers 1, 2, 3, ... 50 printed on them, how many ways are there to select 9 distinct cards, such that no two cards have consecutive numbers printed on them?

Yikes...this question was in my school's trial and it was worth one mark. :')

 

[Trebla]

It’s exam day!

Forgot to mention please turn up around 5-10 mins before actual start time (at latest). See you there!

 

[Trebla]

And we’re off!

 

[psmao]

And we’re off!
View attachment 27277

fascinating problems and I really enjoyed it xD thanks in advance

 

[TheOnePheeph]

fascinating problems and I really enjoyed it xD thanks in advance

What was q16 this year?

 

[sharky564]

As a quick warm up for tomorrow, can anyone answer with reasons
Given 50 cards with the integers 1, 2, 3, ... 50 printed on them, how many ways are there to select 9 distinct cards, such that no two cards have consecutive numbers printed on them?

In general, the number of ways of choosing cards from consecutive cards such that there are at least cards between any pair of cards is , which isn't too difficult to prove using double-counting.

 

[Drdusk]

How was it guys!? What was question 16?

 

[sharky564]

How was it guys!? What was question 16?

16a was proving the Dandelin spheres property
16b was proving the eccentricity of an ellipse is equal to the ratio of the sines of the angle the plane cuts through the cone to the sine of the angle of the cone
16c was determining the probability a game (in which players A and B flip a coin till either 3 heads or 3 tails are flipped in a row) is won by Player A, depending on which face is flipped ifrst

 

[CellerySticks]

 

[Paradoxica]

Thank you to everyone who showed up! I'm sorry for the typos (although nobody noticed that Trebla wrote "focii" instead of "foci"

Here are the papers, edited and refined (and a little bit of visual changes as well to both)

 

[Drdusk]

Thank you to everyone who showed up! I'm sorry for the typos (although nobody noticed that Trebla wrote "focii" instead of "foci"

Here are the papers, edited and refined (and a little bit of visual changes as well to both)

HOLY CRAP THE 4U TRIAL LOOKS HARD AS. MY UNI FINAL ARE EASIER GUYS.

This is much harder than the one I sat last year!!!

 

[Hscbuzman]

I have a feeling this is HscBuzman on an alt acc or something. What do you guys think? @blyatman @jazz519 .

That is defamatory. It is not me....

 

[Drdusk]

That is defamatory. It is not me....

Well sorry mate. I'll delete the message if you think that's the case

 

[Trebla]

Thanks to everyone that attended on the day! Hopefully you guys found some challenging and interesting questions to practice on.

Massive thanks to the rest of the team who helped put the questions and paper together (Paradoxica (esp for the diagrams!), iso1234, jjlim7, Carrotsticks, sharky564, Kingom, RealiseNothing to name a few). Also big thanks to the staff at UTS and iStudy for helping to organise the venue.

We will begin the process of solution writing and marking in the next few weeks and will upload these in due course (before your first maths exam of course!).

In the meantime, if you want any hints/guides on specific questions right now or just want to discuss the paper feel free to post in this thread. Keen to hear your thoughts on both the papers. Were there any questions you particularly liked? How was the difficulty in general and in comparison to previous years (if you attempted those)?

 

[Paradoxica]

Thank you to everyone who showed up! I'm sorry for the typos (although nobody noticed that Trebla wrote "focii" instead of "foci"

Here are the papers, edited and refined (and a little bit of visual changes as well to both)

I have reuploaded the file (into the post) since this was posted, as it was noticed that the slice diagram for the volumes question was missing (I accidentally commented out the line of code for that image, my bad)

Here are the files anyway to avoid confusion.

 

[integral95]

Wow this is definitely harder than the previous years. I see that Carrotsticks having extra assistance from former BOS members (who are also math whizzes ) definitely revoluntionised the content.

However, with the new syllabus being implemented, I wonder what mathematical theorem do you plan to use that could be solved using strictly high-school math.