You are Here: Home >< Maths

# The Proof is Trivial! Watch

1. (Original post by ThatPerson)
Problem 556*

Solve the equation

I have a solution of sorts for the problem (not very elegant though). We can start by seeing that so . Now we can let to make the proof easier to read.

Our equation becomes . Start by noticing that the L.H.S is at least 2 (standard knowledge that the sum of a real number and its reciprocal is at least two, can be seen by simple calculus, AM-GM or various other methods) so x is at least 1 as otherwise .

Multiply the equation by by and rearrange to get a quadratic in . Our equation becomes . Solve for to get that . We can see that is a solution. If we now take logs on both sides then .

Thus the equation is . We show that for the R.H.S is larger than the L.H.S and for the L.H.S is greater. The derivative of the L.H.S is and of the R.H.S is . The L.H.S has constant derivative and the derivative of the R.H.S is always at least which is greater than so the R.H.S derivative is always greater than the L.H.S derivative so the R.H.S grows faster than the L.H.S so they can only intersect in one place which is so there is only one solution.
2. (Original post by ThatPerson)
Problem 556*

Solve the equation

Attempt for even n:
Spoiler:
Show
I remember a STEP I question similar to this:

Assume x is even, and x=2m

Let

But we know that, for some integer A, where [x] is the integer part of x rounded down,

Which clearly has a solution only at

(Original post by Renzhi10122)
Hold on, x is real?
AFAIK, only natural numbers (subset of reals) can be even or odd

(Original post by Renzhi10122)
Exactly, you said 'assume x is even'. I haven't read past that point btw.
Yes, I'm not saying this is a full solution, I'm just solving for even x. As far as I know, there could be an infinite number of solutions in odd x

(Original post by Renzhi10122)
But x is real... you see my point?
Yes, but I don't care x is any real, or only integers, I'm only bothered about the case when x is even...
3. (Original post by Johann von Gauss)
Attempt for even n:
Spoiler:
Show
I remember a STEP I question similar to this:

Assume x is even, and x=2m

Let

But we know that, for some integer A, where [x] is the integer part of x rounded down,

Which clearly has a solution only at
Hold on, x is real?
4. (Original post by Johann von Gauss)
AFAIK, only natural numbers can be even or odd
Exactly, you said 'assume x is even'. I haven't read past that point btw.
5. (Original post by Johann von Gauss)
Yes, I'm not saying this is a full solution, I'm just solving for even x. As far as I know, there could be an infinite number of solutions in odd x
But x is real... you see my point?
6. (Original post by Johann von Gauss)
Yes, but I don't care x is any real, or only integers, I'm only bothered about the case when x is even...
Ah... fair enough, ignore me then.
7. (Original post by Indeterminate)
Problem 552***

Let and

By considering the Maclaurin series of , or otherwise, show that

for

Show that

Solution 552
Spoiler:
Show

For the first part, we note that

Now let and equate real parts.

On the RHS, we have

Now consider the LHS. We have

Hence

for

as required.

Now let

and use the substitution

We get

after splitting it into two parts. Transform the second using the map to get

This

as required.

8. (Original post by Indeterminate)
Solution 552
A bit simpler:

is irrelevant by . Write .

from the natural substitution . Hence
9. (Original post by Lord of the Flies)
A bit simpler:

is irrelevant by . Write .

from the natural substitution . Hence
Very nice; probably the neatest way to do it

My approach was simply based on the first part of the problem.
10. Problem 557 (no star)

Players A and B play a game, and take it in turns, with player A going first. The numbers are written on a (very very long) blackboard. On each player's turn, they must rub out one of the numbers. The game ends when only 2 numbers remain on the blackboard. Player A wins if the sum of these 2 numbers is a square, and player B wins otherwise. Who has the winning strategy, if it exists?
11. Problem 558 (*)

Solve:

12. (Original post by atsruser)
Problem 558 (*)

Solve:

Johann von Gauss
13. (Original post by Johann von Gauss)
Seems too easy, I've probably made a mess of it...
You certainly made a mess of the latex I'm not sure what your solution is meant to be.

And yes, I'm not sure how easy the question is - maybe easier than it seemed to me when writing it.
14. (Original post by Renzhi10122)
Problem 557 (no star)

Players A and B play a game, and take it in turns, with player A going first. The numbers are written on a (very very long) blackboard. On each player's turn, they must rub out one of the numbers. The game ends when only 2 numbers remain on the blackboard. Player A wins if the sum of these 2 numbers is a square, and player B wins otherwise. Who has the winning strategy, if it exists?
Ive got a general feel for the problem but can't go much further tbh.What level is this?

Posted from TSR Mobile
15. Solution 557

The idea is very similar to the ones used to solve the chess-game problems mentioned earlier. Notice .

Claim: it is possible to partition into pairs whose sum is a square. Trivial with and suppose true for . Write a square, note , and pair with for Partition as needed using the hypothesis - done.

As a consequence player 2 has a winning strategy.
16. (Original post by Lord of the Flies)
Solution 557

The idea is very similar to the ones used to solve the chess-game problems mentioned earlier. Notice .

Claim: it is possible to partition into pairs whose sum is a square. Trivial with and suppose true for . Write a square, note , and pair with for Partition as needed using the hypothesis - done.

As a consequence player 2 has a winning strategy.
Beatifully done. I actually understand most of it.

Posted from TSR Mobile
17. (Original post by atsruser)
You certainly made a mess of the latex I'm not sure what your solution is meant to be.

And yes, I'm not sure how easy the question is - maybe easier than it seemed to me when writing it.
I'm tired, I'll leave it for someone better lol
18. (Original post by Lord of the Flies)
Solution 557

The idea is very similar to the ones used to solve the chess-game problems mentioned earlier. Notice .

Claim: it is possible to partition into pairs whose sum is a square. Trivial with and suppose true for . Write a square, note , and pair with for Partition as needed using the hypothesis - done.

As a consequence player 2 has a winning strategy.
Nicely done. What about for 1,2... 4n?

Edit: In fact, don't bother, it's basically the same. My proof was to consider squares mod 4. Split the numbers into blocks of 4 consecutive numbers, from [1,2,3,4], [5,6,7,8]... then pair off the numbers in each block with 0,3 and 1,2 so that the numbers you get left with add the end with sum to 3, which is not a square.
19. (Original post by physicsmaths)
Ive got a general feel for the problem but can't go much further tbh.What level is this?

Posted from TSR Mobile
Hungarian maths olympiad. Dunno how hard it is in absolute terms, but it could go on bmo2 somewhere around q2.
20. Problem 559

I put this up in a separate thread with little response so here it is again. Not very difficult - maybe something that may appear on a MAT paper.

Consider the point for large .

Find the value of for which the point is approximately distant from A.

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: January 5, 2018
Today on TSR

### Anxious about my Oxford offer

What should I do?

### US couple arrested - 13 children chained up

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