You are Here: Home >< Maths

# The Proof is Trivial! Watch

1. Alternative (1) Solution 526:

We know that and we know that is irrational. This means taht we need only prove that is irrational.

We can do so easily, since . Now assume that this equals where then we have so that , contradiction so is irrational and we are done.
2. A little basic number theory pilfered from Putnam.

Problem 537: **
Show that for each , where is prime.
.

Problem 538: **
Show that there are no integer solutions to:
where .
3. (Original post by joostan)
A little basic number theory pilfered from Putnam.

Problem 537: **
Show that for each :
.

Problem 538: **
Show that there are no integer solutions to:
where .
What's p? A prime?
4. (Original post by Renzhi10122)
What's p? A prime?
Yarp, p's a prime.
Probably shoulda specified, but I'd say it's reasonably clear from context.
5. (Original post by joostan)
Yarp, p's a prime.
Probably shoulda specified, but I'd say it's reasonably clear from context.
Fair enough

Solution 537

Firstly note that . By the LTE lemma, we have
, where is the greatest power of 2 that divides . Therefore, is divisible by , a stronger result. Now note that is not divisible by 3,5, or 17, since it is prime. By Fermat's Little Theorem, . Noting that each of 3, 5 and 17 can be written in the form , in particular, for , setting as each of the three primes, we see that 32 is a multiple of , and so is divisible by 3, 5 and 17.
Thus, and indeed for all primes .

EDIT: We could've used difference of two squares for the first bit, but only thought of that afterwards
6. Solution 537 (2)
Damn I really was a bit slow :-)
Spoiler:
Show

First note that
If p is a prime greater than 17 then p is odd and not divisible by 3, hence therefore and hence , or , in which case since and hence So .

Note that we can rewrite the expression as . Each factor is even since p is odd and hence any power of p is odd. Hence

Finally let us consider the divisor 17. If p is a prime greater than 17 then p and 17 are coprime. Hence by Fermat's Little Theorem

and hence so

So 3, 5, 64 and 17 divide . Hence 16320 divides .

7. (Original post by Renzhi10122)
x
(Original post by 16Characters....)
x
Impressive, both of you. My number theory is ****e...

Protip: To typeset use a \equiv b \pmod c instead of a \equiv b (mod c) since that just squishes the variables together.

Edit: It evens saves you the hassle of putting the brackets around the mod and it just requires a slash and a p before the mod.
8. Some more analysis

Problem 539

Let be any function that is continuous on

Prove that there exists a constant such that

Posted from TSR Mobile
9. (Original post by Indeterminate)
Some more analysis

Problem 539

Let be any function that is continuous on

Prove that there exists a constant such that

Posted from TSR Mobile
Solution 539.

Suppose that for all . Then we must have , which is impossible since this states f(1) is not in the codomain. A similar argument at x=0 shows we cannot have f(x)<sin(x*pi/2) for all x in [0,1] either.

Thus there must exist for which , and such that . Suppose without loss of generality we have . Let . Then at a, and at b . Thus by the intermediate value theorem, there exists a such that for which , which implies by construction of g

Edit: A nice intuitive picture for how this theorem works: Draw a square, and from the bottom left corner to the top right corner, draw a curve resembling the graph of sin from 0 to pi/2. Now try and join the left side to the right side with a continuous curve that doesn't intersect the sine curve .
10. (Original post by FireGarden)
Solution 539.

Suppose that for all . Then we must have , which is impossible since this states f(1) is not in the codomain. A similar argument at x=0 shows we cannot have f(x)<sin(x*pi/2) for all x in [0,1] either.

Thus there must exist for which , and such that . Suppose without loss of generality we have . Let . Then at a, and at b . Thus by the intermediate value theorem, there exists a such that for which , which implies by construction of g
All fine, but a bit verbose:

Define g(x) = sin(pi x / 2) - f(x). Then g(0) = -f(0), g(1) = 1- f(1) and so since we know 0<=f(x)<=1, g(0)<=0, g(1)>=0. If we have equality in either case we're done, otherwise by IVT we can find k in (0,1) with g(k) = 0 and we're done.

[Questions like this come up often enough that you should make sure you know how to answer them concisely. The defn of IVT I use requires f(a) < 0, f(b) > 0 (i.e. it doesn't allow equality) or it could go a little shorter still].
11. Problem 540 (**/***)

a) Show that:

stating any conditions that must hold for this to be valid.

b) Find the value of

(Hints available if necessary)
12. (Original post by atsruser)
Problem 531: */**

Give a geometrical argument to show that, if , then

Bumping with hints:

Spoiler:
Show
Hint 1)

Note that since , we have .

Which property of the curve does measure?

Spoiler:
Show

is a fixed, small increment in ; how does vary as varies from 0 to 1?; which property of the curve varies with in a similar way?

Hint 2)

To which points on the curve do the limits correspond? What is the significance of the values of the limits, and what is their relationship to the quantity measured by ?

13. (Original post by atsruser)
x
That's quite an interesting problem, unfortunately, it's three in the morning here and I'm heading off to bed, but I'll give these a try first thing in the morning, thanks for your contribution!

I can't quite wrap my head around the whole thing.
14. Can't believe I've never used this thread before.

Posted from TSR Mobile
15. UProblem 541
Prove the for natural n the fraction (21n+4)/(14n+3) is irreducible.
I will post a solution later on today.

This is a problem from an old IMO problem!
Posted from TSR Mobile
16. Solution 541:
Observe that .
Thus if and for then so .
Hence we have and coprime, so:
is irreducible.
17. (Original post by joostan)
Solution 541:
Observe that .
Thus if and for then so .
Hence we have and coprime, so:
is irreducible.
Mine essentially the same but slight different at the start I think.
Gcd(21n+4,14n+3)=gcd(7n+1,14n+3)
=gcd(7n+1,14n+3-2(7n+1))
=gcd(7n+1,1)=1 Q.E.D

Posted from TSR Mobile
18. (Original post by physicsmaths)
Mine essentially the same but slight different at the start I think.
Gcd(21n+4,14n+3)=gcd(7n+1,14n+3)
=gcd(7n+1,14n+3-2(7n+1))
=gcd(7n+1,1)=1 Q.E.D

Posted from TSR Mobile
Sorry to be a buzzkill, but it's specified in the OP to Latex all solutions/problems (I understand that you're on an iPad, but it's not hard to use Latex) - just to maintain austerity.

Also - it's fine to post a solution to your own problem once somebody else has already answered it, but not before.
19. (Original post by 16Characters....)
Problem 508

is an N x N matrix with N distinct eigenvalues all in the range . Prove that:

Converges. {NB: I denotes the N x N identity matrix}
Bumping with a hint:

Spoiler:
Show

A matrix with all of its eigenvalues distinct is diagonalisable.
20. (Original post by 16Characters....)
Problem 508

is an N x N matrix with N distinct eigenvalues all in the range . Prove that:

Converges. {NB: I denotes the N x N identity matrix}
Let
Since has distinct eigenvalues, we can write for some fixed, invertible matrix , and where .
Notice that:
.
But .
(Assuming , if so then so still converges.)
Hence we have that:
.
Thus the sum converges.

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: December 11, 2017
Today on TSR

### What is the latest you've left an assignment

And actually passed?

### Simply having a wonderful Christmas time...

Discussions on TSR

• Latest
• ## See more of what you like on The Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

• 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
• ## See more of what you like on The Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

• 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

Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.