You are Here: Home >< Maths

# The Proof is Trivial! watch

1. (Original post by Slumpy)
Can't you do that in about one step? 1^2=3^2=5^2=7^2=1mod8, so the only a s.t. a^k=7mod8 for some k is 7.
Indeed! Now I just can't remember why I took k<l,m without loss of generality yesterday.
2. (Original post by und)
Indeed! Now I just can't remember why I took k<l,m without loss of generality yesterday.
The order is irrelevant, so by relabeling you can guarantee that k<l,m.
3. (Original post by Slumpy)
The order is irrelevant, so by relabeling you can guarantee that k<l,m.
I know but what about k=l<m. I'm sure I had good reasons!
4. Solution 45

Clearly we cannot have because this would imply that had a factor of and hence that . Consider . By writing and dividing, we get:

Since is odd, the right hand side is even and is a multiple of . Therefore in the case where (with equality does not divide the right hand side, so this is impossible) where we can assume without loss of generality that , .

It can be shown by exhaustion that for some if, and only if, .

Now consider . Clearly is odd, and by exhaustion it can be shown that the residue of , completing the proof.
5. (Original post by und)
Solution 45 (almost complete)

Clearly we cannot have because this would imply that had a factor of and hence that . Furthermore, ... Therefore, without loss of generality we can assume . By writing and dividing, we get:

Since is odd, the right hand side is even and is a multiple of . Therefore in the case where (with equality does not divide the right hand side, so this is impossible) where we can assume without loss of generality that , .

It can be shown by exhaustion that for some if, and only if, , completing the proof.
Doesn't k have to be even for this to be true?
6. (Original post by metaltron)
Doesn't k have to be even for this to be true?
If k is odd then n is not an integer.
7. (Original post by und)
...
Excellent. The last step can be done by contradiction.
Spoiler:
Show
Assume . Thence - contradiction. Hence and .
8. (Original post by und)
If k is odd then n is not an integer.
Of course! Well done.
9. This has a really neat little solution. And it is a good demonstration of how useful modular arithmetic can be.

Problem 49**

Show that
10. Solution 49

We have .
Excellent. The last step can be done by contradiction.
Spoiler:
Show
Assume . Thence - contradiction. Hence and .
I still need to prove it for .
Solution 49

We have .
What are the conditions for replacing everything with its modular counterpart? I'm not that familiar with modular arithmetic so I should probably read up on it a little.
13. (Original post by und)
I still need to prove it for .
Not really. Assume . Then is a perfect square (why?). Hence .

(Original post by und)
What are the conditions for replacing everything with its modular counterpart? I'm not that familiar with modular arithmetic so I should probably read up on it a little.
Those are relatively prime to 7. Use Fermat's little theorem and
Not really. Assume . Then is a perfect square (why?). Hence .
It's clear that it's a perfect square but the second part isn't that clear in my opinion so I'll add it in.
15. Problem 50:

An inextensible rope of length l and uniform mass per unit length lies on a rough table with one end on an edge. The co-efficient of friction between the table and the rope is μ. The rope receives an impulse which sets it moving off of the edge of the table at speed v. Prove that, if the rope does not fall off the table, then:

By considering this as varies between zero and 1, find the maximum possible impulse that could potentially be given to the rope without it falling off of the table.
16. (Original post by DJMayes)
Problem 50:

An inextensible rope of length l and uniform mass per unit length lies on a rough table with one end on an edge. The co-efficient of friction between the table and the rope is μ. The rope receives an impulse which sets it moving off of the edge of the table at speed v. Prove that, if the rope does not fall off the table, then:

By considering this as varies between zero and 1, find the maximum possible impulse that could potentially be given to the rope without it falling off of the table.
Having solved the equation and obtained something not very nice, I don't feel inclined to continue!
17. Problem 51**

One of my favorite number theory problems.

Let be an integer, and be the number of distinct prime divisors of . Then there exists an integer , , such that .

Problem 52**

Find all infinite bounded sequences of positive integers such that for each , .

Problem 53**

For those who have not covered much number theory.

Let be a positive integer. Then there exist infinitely many positive integers such that is a perfect suqare.
18. (Original post by und)
Having solved the equation and obtained something not very nice, I don't feel inclined to continue!

If you want to check solutions then you can PM me; mine may well need checking as well.
19. (Original post by ukdragon37)
A little, yes. But then topos theory is quite a different beast to set theory.
In the Cambridge 4th year some people (tried) to run a Topos Theory reading group. I think in the end only about 5 or so people finished the course.

I started it and then gave up after about 6-7 'lectures' because it was just utterly incomprehensible.
20. (Original post by DJMayes)

If you want to check solutions then you can PM me; mine may well need checking as well.
This didn't exactly inspire confidence:

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: February 15, 2018
Today on TSR

### Buying condoms for the first time - help!

Discussions on TSR

• Latest
Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams

## Groups associated with this forum:

View associated groups
Discussions on TSR

• Latest

The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE