• Congratulations to the Class of 2024 on your results!
    Let us know how you went here
    Got a question about your uni preferences? Ask us here

Is it possible to prove... (1 Viewer)

IAU001

Member
Joined
Dec 23, 2006
Messages
47
Gender
Male
HSC
2009
How do I prove:
(20<sup>22</sup> - 17<sup>22</sup> + 4<sup>33</sup> - 1) is divisible by 174.

One thing I've noticed is that if you divide all the exponents of the numbers by 11, which would become (20<sup>2</sup> - 17<sup>2</sup> + 4<sup>3</sup> - 1) is exactly equal to 174. I don't know if that will help but that is one thing I noticed. Sorry I'm in Year 10 and I can't solve this question. Any help is greatly appreciated.

Thanks
 
Last edited:

jb_nc

Google &quot;9-11&quot; and &quot;truth&quot;
Joined
Dec 20, 2004
Messages
5,391
Gender
Male
HSC
N/A
Why wouldn't it be divisible? Why wouldn't any real number be able to divide that?

I'm not sure what you mean. This is probably more general related work.
 

AMorris

Member
Joined
Sep 6, 2005
Messages
56
Location
Sydney
Gender
Male
HSC
2007
I'm guessing that this is from the Polya Enrichment Series? (sounds like one of those questions)

So with this question you have to use modular arithmetic and also notice the prime factorisation of 174 = 2*3*29

so basically the problem reduces to three sub problems of proving the expression is congruent to 0 mod 2; mod 3; mod 29. the mod 2 case is dead easy. the mod 3 case should pose any difficulty either. for the mod 29 case you have to take notice of the fact that the exponents are all multiples of 11 and use that fact to help you. If you are still making no progress ask again and I'll give some more hints.
 

IAU001

Member
Joined
Dec 23, 2006
Messages
47
Gender
Male
HSC
2009
Sorry AMorris but I'm only in Year 10, and as such don't have any clue as to what modular arithmetic is. Is there any other way to do this?
 

kony

Member
Joined
Feb 10, 2006
Messages
322
Gender
Undisclosed
HSC
2007
modular arithmetic is a very simple concept (it was in year 7 maths enrichment) - so you definitely should be able to understand it - just look it up.
 

jb_nc

Google &quot;9-11&quot; and &quot;truth&quot;
Joined
Dec 20, 2004
Messages
5,391
Gender
Male
HSC
N/A
yeah theres a lesson on wikibooks you should be able to grasp it within 30mins-1hr.
 

IAU001

Member
Joined
Dec 23, 2006
Messages
47
Gender
Male
HSC
2009
Oh lol woops...OK thanks I shall have a look.
 

AMorris

Member
Joined
Sep 6, 2005
Messages
56
Location
Sydney
Gender
Male
HSC
2007
Zozo6969 said:
Mathematical induction
I don't see that as working because this is only really valid when the exponents are a specific set of numbers. These questions are very different to the 3u questions where you asked to prove the divisibility by induction and they require far stronger techniques.

And kagrawal - where did u get these questions from?
 
Joined
Mar 3, 2005
Messages
2,359
Location
Wollongong
Gender
Male
HSC
2006
kagrawal said:
My friend is doing enrichment and he photocopied me the problems. I don't remember which stage he's doing but yeah. I can't do any of them and I top my year in Maths every year since year 7. That's how I got the problems. Also, if i can't do these problems, am I losing my touch? Because I'm aiming to do 3 unit next yr but this is making me double back and think about it.
no. ive gathered you are very good at maths, stick with three unit at the very least.

p.s. ive got no idea how to do that question (mostly cos i havent seen any of that kind and cbf looking it up) and i'm doing first year uni maths :eek:
 

AMorris

Member
Joined
Sep 6, 2005
Messages
56
Location
Sydney
Gender
Male
HSC
2007
Don't worry about it all kagrawal. These sort of questions require vry different sort of thinking to those that you would get in 3u. And the mathematics required to solve this problem (modular arithmetic) is completely unneccessary for the 3u (or any nsw hsc) syllabus.

I don't think theres any other way of solving this problem using elementary mathematics without resorting modular arithmetic either.
 

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

Top