• Best of luck to the class of 2024 for their HSC exams. You got this!
    Let us know your thoughts on the HSC exams here
  • YOU can help the next generation of students in the community!
    Share your trial papers and notes on our Notes & Resources page
MedVision ad

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

Status
Not open for further replies.

dan964

what
Joined
Jun 3, 2014
Messages
3,479
Location
South of here
Gender
Male
HSC
2014
Uni Grad
2019
Re: HSC 2014 4U Marathon - Advanced Level

q14 and 16 are both out of 16 not 15
 
Last edited:

Sy123

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

Here is a good question:

 

RealiseNothing

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

Here is a good question:

is the number of positive divisors of , and note that these divisors must occur in pairs and thus is even.

Define the divisors to be







 

dan964

what
Joined
Jun 3, 2014
Messages
3,479
Location
South of here
Gender
Male
HSC
2014
Uni Grad
2019
Re: HSC 2014 4U Marathon - Advanced Level

Errata in q16, last part is R^2 not R
 

Sy123

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

is the number of positive divisors of , and note that these divisors must occur in pairs and thus is even.

Define the divisors to be







Nice proof!
Here is mine:









 
Last edited:

glittergal96

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

Realisenothing, were you able to find a closed form for that sum in the end? I am still a bit doubtful that one exists.

Thanks for posting so many questions Dan, will try some this afternoon.
 

glittergal96

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

By the way, I think the "only if" statement in 15bii) is not true. Counterexample: p=561.
 

dan964

what
Joined
Jun 3, 2014
Messages
3,479
Location
South of here
Gender
Male
HSC
2014
Uni Grad
2019
Re: HSC 2014 4U Marathon - Advanced Level

By the way, I think the "only if" statement in 15bii) is not true. Counterexample: p=561.
read the question "absolutely every n" is the key phrase. Sure it may work for non-prime p for certain n, but for all.
If you think I am bluffing, Q15b is a reworking of Fermat's theorem.

2047 is another. Have you tried with base 3 (n=3), or base 5 (n=5) as well.
part (iii) proves that for n=2, some numbers other than primes work e.g. 2047

the proof to Q15(b)(ii) comes from part (i) which is an interesting property of Pascal's triangle that can be proved quite easily.

Errata Q14 (A)(ii) use part (i)


One other interesting thing about Primes (p>5), and testing for them. (a quick way)
1. You can test all numbers up to the squareroot
2. Check whether divisible by 2,3 and 5.
3. You can easily check whether the last digit is a 2,4,5,6,8 or 0
4. You can also only divide by numbers that are of the form 6m +1 or 6m - 1 (since all primes occur either side of these numbers), so that removes all multiples of 3 as well.




here is an interesting extension (for if p/n is not an integer) for all prime numbers if I write (p-1) 1s (then a zero) in that base it is also divisible. (Provided n/= p). Hence 1,111,110 (and therefore 111,111) is divisible by 7, and 111,111,111,1110 and therefore (111,111,111,111) is divisible by 13.
 
Last edited:

glittergal96

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

read the question "absolutely every n" is the key phrase. Sure it may work for non-prime p for certain n, but for all.
If you think I am bluffing, Q15b is a reworking of Fermat's theorem.

2047 is another. Have you tried with base 3 (n=3), or base 5 (n=5) as well.
part (iii) proves that for n=2, some numbers other than primes work e.g. 2047

the proof to Q15(b)(ii) comes from part (i) which is an interesting property of Pascal's triangle that can be proved quite easily.

Errata Q14 (A)(ii) use part (i)


One other interesting thing about Primes (p>5), and testing for them. (a quick way)
1. You can test all numbers up to the squareroot
2. Check whether divisible by 2,3 and 5.
3. You can easily check whether the last digit is a 2,4,5,6,8 or 0
4. You can also only divide by numbers that are of the form 6m +1 or 6m - 1 (since all primes occur either side of these numbers), so that removes all multiples of 3 as well.




here is an interesting extension (for if p/n is not an integer) for all prime numbers if I write (p-1) 1s (then a zero) in that base it is also divisible. (Provided n/= p). Hence 1,111,110 (and therefore 111,111) is divisible by 7, and 111,111,111,1110 and therefore (111,111,111,111) is divisible by 13.
I did read the question.

I claim that for every n, p=561 satisfies the statement "n^p-n is divisible by p" despite 561 not being prime. If you think there is an n such that this is not true can you please supply it?

I don't think you are "bluffing", I just don't believe the statement you made is true. Also, Fermat's little theorem is equivalent to the "if" statement, not the "only if".

Part i) is true because the prime factorisation of the denominator of p!/k!(p-k)! does not contain any copies of p toe cancel out the numerator's. So each pCk is divisible by p for k=1,2,...,p-1. It is easy to use this result to prove the "if" statement in ii) inductively, but I still don't believe the "only if".
 

dan964

what
Joined
Jun 3, 2014
Messages
3,479
Location
South of here
Gender
Male
HSC
2014
Uni Grad
2019
Re: HSC 2014 4U Marathon - Advanced Level

Prove by induction for n rather than p is a bit easier.
 

glittergal96

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

Use a similar method to Q15(b) with n = 3 but this time prove by contradiction it doesn't work.
Done
What is this post in reply to? I still think n^561-n is divisible by 561 for every positive integer n, despite 561 not being prime. This is in contradiction with the "only if" part of your question. (By the way, I got this number because it is the lowest Carmichael number, and I checked the non-coprime moduli myself.)

Prove by induction for n rather than p is a bit easier.
I never said induction in p, that would be insane/impossible because p goes over the primes. I meant induction in n, which is straightforward because



The first RHS term is divisible by p because of the inductive assumption, and each binomial coefficient in the second is divisible by p for the reason I described in my previous post. So the whole thing is divisible by p.
 

RealiseNothing

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

read the question "absolutely every n" is the key phrase. Sure it may work for non-prime p for certain n, but for all.
If you think I am bluffing, Q15b is a reworking of Fermat's theorem.
FLT is not IFF, glittergal is right.
 

dan964

what
Joined
Jun 3, 2014
Messages
3,479
Location
South of here
Gender
Male
HSC
2014
Uni Grad
2019
Re: HSC 2014 4U Marathon - Advanced Level

fine then a small edit:

Restriction: Provided that (6m+1), (12m+1), (18m+1) are not prime factors; if p is composite.
i.e. Carmichael numbers.
**The point of the question is the "only if" to see if you can

If you divide both sides in Q15b by the 'n' then the expression no longer works for Carmichael Numbers or when p=n.
Which is probably the edit I am going to make.
 
Last edited:

glittergal96

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

fine then a small edit:

Restriction: Provided that (6m+1), (12m+1), (18m+1) are not prime factors; if p is composite.
Wait, so what is the full question then? I don't see how this fits in anywhere that makes sense.
 
Status
Not open for further replies.

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

Top