This discussion is now closed.

Check out other Related discussions

- Maths Problem Solving
- How to get improve general problem solving skills and for MAT
- What are these a levels and their courses like?
- Is the physics in an Engineering degree much harder than A Level physics?
- Oxbridge mathematics supercurriculars, 2025 entry
- Starting GCSES looking to get into Oxbridge Maths
- Screwed for Cambridge application?
- Tips for A*s?
- S6 Subject Choice
- am i finished
- Should A-level Maths or A-level Statistics be compulsory?
- 2nd year success
- Mat 2024
- University Degree
- how to improve in maths a level?
- Should I reconsider applying to medicine if I love maths?
- alevel choices
- Advice for Applying to EEE at Imperial
- A level subject combo help!!!
- Correlation between UKMT Maths challenge and being able to do Maths at Uni

Could you give me some solution for those questions?

1. prove 'n^3 + 5n is divisible by 6' without using induction

2. let m, n be coprime positive integers, with m is greater than 1.

Prove that if log(base m)n is rational then it is 0.

3. there are six towns, such that between each pair of towns there is either a train or bus service (but not both). Prove that there are three towns that can be visited in a loop (going via no other towns) using only on mode of transport.

1. prove 'n^3 + 5n is divisible by 6' without using induction

2. let m, n be coprime positive integers, with m is greater than 1.

Prove that if log(base m)n is rational then it is 0.

3. there are six towns, such that between each pair of towns there is either a train or bus service (but not both). Prove that there are three towns that can be visited in a loop (going via no other towns) using only on mode of transport.

1. Factorise

2. Maybe raise both sides to a power?

3. Draw a diagram to start with I'd say

2. Maybe raise both sides to a power?

3. Draw a diagram to start with I'd say

cyh910907

Could you give me some solution for those questions?

1. prove 'n^3 + 5n is divisible by 6' without using induction

2. let m, n be coprime positive integers, with m is greater than 1.

Prove that if log(base m)n is rational then it is 0.

3. there are six towns, such that between each pair of towns there is either a train or bus service (but not both). Prove that there are three towns that can be visited in a loop (going via no other towns) using only on mode of transport.

1. prove 'n^3 + 5n is divisible by 6' without using induction

2. let m, n be coprime positive integers, with m is greater than 1.

Prove that if log(base m)n is rational then it is 0.

3. there are six towns, such that between each pair of towns there is either a train or bus service (but not both). Prove that there are three towns that can be visited in a loop (going via no other towns) using only on mode of transport.

For the first one, n is either of the form 6k, 6k+1, 6k+2, 6k+3, 6k+4, 6k+5 where k is a non-negative integer.

You can factorise the expression and then simply try each possibility. Obviously, 6k+2=2(3k+1), 6k+3=3(2k+1), 6k+4=2(3k+2)..

For the second, then you can raise it to the powers and use some sort of contradiction. If m^(p/q)=n, where (m,n)=1 and (p,q)=1 ...i.e. it's in its lowest form...

cyh910907

3. there are six towns, such that between each pair of towns there is either a train or bus service (but not both). Prove that there are three towns that can be visited in a loop (going via no other towns) using only on mode of transport.

More generally, you've posted 6 questions in the course of an evening. You should spend time on these questions yourself before asking for help. And when you do ask for help, let us know what you've tried already, and what your thoughts are.

I would also say that questions you're asking have a fairly wide range of difficulty - where are you getting them from? The first two here are pretty routine, but the 3rd one is pretty hard. (My guess would be more people know how to answer it because they've seen it before than worked it out for themselves).

Well, there Is a modified version of the pigeonhole principle involved. If there are 5 pigeons that go into 2 holes, 1 hole will receive at least $\lceil \frac{5}{2} \rceil=3$ pigeons. If this does not make sense, try to fill those holes while keeping all of them with less than 3 pigeons.

Cookie The Blue Monster

Well, there Is a modified version of the pigeonhole principle involved. If there are 5 pigeons that go into 2 holes, 1 hole will receive at least $\lceil \frac{5}{2} \rceil=3$ pigeons. If this does not make sense, try to fill those holes while keeping all of them with less than 3 pigeons.

- Maths Problem Solving
- How to get improve general problem solving skills and for MAT
- What are these a levels and their courses like?
- Is the physics in an Engineering degree much harder than A Level physics?
- Oxbridge mathematics supercurriculars, 2025 entry
- Starting GCSES looking to get into Oxbridge Maths
- Screwed for Cambridge application?
- Tips for A*s?
- S6 Subject Choice
- am i finished
- Should A-level Maths or A-level Statistics be compulsory?
- 2nd year success
- Mat 2024
- University Degree
- how to improve in maths a level?
- Should I reconsider applying to medicine if I love maths?
- alevel choices
- Advice for Applying to EEE at Imperial
- A level subject combo help!!!
- Correlation between UKMT Maths challenge and being able to do Maths at Uni

Last reply 2 weeks ago

STEP 2 in 2024: Sharing Your Story! [PLUS WITH SOME SOLUTIONS AND PREDICTION]Maths

19

80

Last reply 2 weeks ago

A level maths paper 2 (pure and statistics) and paper 3 (pure and mechanics) ocrMaths

4

6

Last reply 2 weeks ago

STEP 2 in 2024: Sharing Your Story! [PLUS WITH SOME SOLUTIONS AND PREDICTION]Maths

19

80

Last reply 2 weeks ago

A level maths paper 2 (pure and statistics) and paper 3 (pure and mechanics) ocrMaths

4

6