HSC 2015 MX2 Marathon ADVANCED (archive) (1 Viewer)

Status
Not open for further replies.

abecina

Member
Joined
Aug 24, 2008
Messages
44
Gender
Male
HSC
N/A
Re: HSC 2015 4U Marathon - Advanced Level

Hi seanieg89. I can get some sort of induction argument going, but was wondering if there is a proof by contradiction. It seems just right for one!?
 

seanieg89

Well-Known Member
Joined
Aug 8, 2006
Messages
2,662
Gender
Male
HSC
2007
Re: HSC 2015 4U Marathon - Advanced Level

Hi seanieg89. I can get some sort of induction argument going, but was wondering if there is a proof by contradiction. It seems just right for one!?
I think my method was an induction, but might have involved contradiction in proving one of the steps.

Not sure about whether or not you can avoid induction.
 

simpleetal

Member
Joined
Apr 6, 2015
Messages
54
Gender
Male
HSC
2016
Re: HSC 2015 4U Marathon - Advanced Level

Assuming that the symbol means "for x between and including 0, and 1", I get an integer answer. Is it an integer answer? I'd like post my solution, but only if I'm sure that there's no sillies.
 

Trebla

Administrator
Administrator
Joined
Feb 16, 2005
Messages
8,393
Gender
Male
HSC
2006
Re: HSC 2015 4U Marathon - Advanced Level

I think this question is beyond the Ext2 course (the whole idea of convex sets and the intersections of such sets).
 

seanieg89

Well-Known Member
Joined
Aug 8, 2006
Messages
2,662
Gender
Male
HSC
2007
Re: HSC 2015 4U Marathon - Advanced Level

sorry but can you explain what the question is asking for? I don't know what that last symbol is supposed to mean.
Do you understand the definition of a convex set in the first sentence?

Then the second sentence is just asking:

If we have a finite collection of convex sets in the plane such that any three sets from this collection share a common point, then show that there exists a point common to ALL of the sets in this collection.
 

Sy123

This too shall pass
Joined
Nov 6, 2011
Messages
3,730
Gender
Male
HSC
2013
Re: HSC 2015 4U Marathon - Advanced Level

 

seanieg89

Well-Known Member
Joined
Aug 8, 2006
Messages
2,662
Gender
Male
HSC
2007
Re: HSC 2015 4U Marathon - Advanced Level

This is only necessarily true if:
a) The polynomial has real coefficients. (Otherwise any three different complex numbers with the same imaginary part can be non-real roots of a polynomial with positive .)
b) The polynomial has distinct roots. (If any roots have multiplicity > 1, then . Still, all roots will be real in this case).

Under these assumptions, we now prove your claim.

The only if is trivial.

Now suppose such a cubic has not all roots real. As non-real roots come in conjugate pairs, we must have roots for some real and some non-real .
So



So any cubic polynomial with positive must have all roots real and distinct.

Interesting point: The obvious generalisation of this quantity alone doesn't tell us whether the roots are all real if we are talking about higher degree polynomials! (Eg for a quartic, you can have two pairs of conjugate roots, and so two negative terms in with positive product.) A potentially fun challenge problem is to construct a quantity in terms of a monic quartic's coefficients (maybe assume that the ^3 coefficient is zero to simplify the calculations. this can be arranged by a linear substitution anyway) that is positive if and only if it's roots are distinct reals.
 
Last edited:

glittergal96

Active Member
Joined
Jul 25, 2014
Messages
418
Gender
Female
HSC
2014
Re: HSC 2015 4U Marathon - Advanced Level

Let

(Note that the evaluation at any three points uniquely determines a polynomial of degree <= 2, and that the conditions of the question imply that ).

Solving the resulting simultaneous equations gives a,b,c in terms of the .

We get





Now the triangle inequality tells us




So , and we can obtain equality with , that is for example.
 

glittergal96

Active Member
Joined
Jul 25, 2014
Messages
418
Gender
Female
HSC
2014
Re: HSC 2015 4U Marathon - Advanced Level

Okay, so let be the claim for a given positive integer .

Let's assume that we know and for some .

Then we will show that is true.

To see this, let be such a collection of convex sets.

Then write As the intersection of two convex sets is convex (I can write a separate proof for this if its not obvious enough for me to assume), we have that is a collection of convex sets.

Moreover, for any distinct , we have
where the last inequality follows from and our assumption that every triple of sets from has a common element.

In other words we have shown that every triple of sets from has a common point.

From we conclude that , which is precisely the statement .

This reduces the problem to proving , which can be tackled geometrically. I will do this in a separate post now to make the whole proof more readable.
 

glittergal96

Active Member
Joined
Jul 25, 2014
Messages
418
Gender
Female
HSC
2014
Re: HSC 2015 4U Marathon - Advanced Level

Suppose were not true.

Then given such convex sets , we could find distinct points in the plane such that is only in the three sets that AREN'T .

But any four points in the plane define a unique convex quadrilateral Q.

Without loss of generality suppose this quadrilateral has vertices in anti-clockwise order.

Then by convexity, the diagonal lies in and the diagonal lies in .

As the diagonals of a convex quadrilateral intersect, that means the point of intersection of these diagonals must lie in every .

This completes the proof of , and hence the whole problem.
 

Chlee1998

Member
Joined
Oct 1, 2014
Messages
90
Gender
Male
HSC
2015
Re: HSC 2015 4U Marathon - Advanced Level

Suppose were not true.

Then given such convex sets , we could find distinct points in the plane such that is only in the three sets that AREN'T .

But any four points in the plane define a unique convex quadrilateral Q.

Without loss of generality suppose this quadrilateral has vertices in anti-clockwise order.

Then by convexity, the diagonal lies in and the diagonal lies in .

As the diagonals of a convex quadrilateral intersect, that means the point of intersection of these diagonals must lie in every .

This completes the proof of , and hence the whole problem.
Can you post a problem which you found to be quite tough from when you were year 12?
 

glittergal96

Active Member
Joined
Jul 25, 2014
Messages
418
Gender
Female
HSC
2014
Re: HSC 2015 4U Marathon - Advanced Level

Can you post a problem which you found to be quite tough from when you were year 12?
I can't really remember off the top of my head. Try some of the problems from olympiads.
 

Chlee1998

Member
Joined
Oct 1, 2014
Messages
90
Gender
Male
HSC
2015
Re: HSC 2015 4U Marathon - Advanced Level

Prove that (n+1)^(n+1) + (-n)^n is not divisble by 9 for any natural number n.
 

RealiseNothing

what is that?It is Cowpea
Joined
Jul 10, 2011
Messages
4,591
Location
Sydney
Gender
Male
HSC
2013
Re: HSC 2015 4U Marathon - Advanced Level

Define a function by:



Where is prime, is real, and is the highest integer power of that divides .

Note that doesn't have to be integer. i.e.

You are given that the function defined has the property that:



Use this function to prove that the square root of all non-square positive integers is irrational.
 
Last edited:

InteGrand

Well-Known Member
Joined
Dec 11, 2014
Messages
6,109
Gender
Male
HSC
N/A
Re: HSC 2015 4U Marathon - Advanced Level

Define a function by:



Where is prime, is a positive integer, and is the highest power of that divides .

Note that doesn't have to be integer. i.e.

You are given that the function defined has t
he property that:



Use this function to prove that the square root of all non-square positive integers is irrational.
How can we have the example of ? Didn't you say needed to be integer?
 
Last edited:
Status
Not open for further replies.

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

Top