The Student Room Group

The Proof is Trivial!

Scroll to see replies

Original post by bananarama2
Sorry :tongue: Although I think I may have done you a favor, it took and hour and a half to type that. :pierre:


It's okay :ahee: the problem that I have with these questions isn't the theory behind it, it's actually computing it (the amount of mistakes I made first time around was scary :zomg:)
Original post by cpdavis
It's okay :ahee: the problem that I have with these questions isn't the theory behind it, it's actually computing it (the amount of mistakes I made first time around was scary :zomg:)


Agreed. I missed of loads of terms and was on the verge of giving up, it's distinctly dodgy approximation too.
Reply 442
Well done guys! :awesome:
Reply 443
Sorry
(edited 11 years ago)
Solution 53

The proof is trivial for k<3k<3. Now suppose that for some k3k\geq 3 there exists mm such that m27(2k)m^2\equiv -7\pod{2^k}.
If 2k(m2+7)=2pm27(2k+1)2^{-k}(m^2+7)=2p\Rightarrow m^2\equiv -7\pod{2^{k+1}}. On the other hand, if 2k(m2+7)=2p1m2+2k7(2k+1)2^{-k}(m^2+7)=2p-1\Rightarrow m^2+2^k\equiv -7\pod{2^{k+1}} hence by letting m=m+2k1m27(2k+1)m'=m+2^{k-1}\Rightarrow m'^2\equiv -7\pod{2^{k+1}}. Noting that 127(23)1^2\equiv -7\pod{2^3} it follows inductively that there is always some q0q_0 such that q027(2k)q_0^2\equiv -7\pod{2^k} Define qi=q0+i2kqi27(2k)(qi2=ni2k7)q_i=q_0+i2^k\Rightarrow q_i^2\equiv -7\pod{2^k}\quad (\Leftrightarrow q_i^2=n_i2^k-7). The proposition follows.
Reply 445
Problem 60**/***

Evaluate the integral I=sin(π4x2+1x2)dx\displaystyle I=\int^{\infty}_{-\infty}sin{\left({\pi}^{4}x^{2}+\frac{1}{x^2}\right)}dx.
(edited 11 years ago)
Reply 446
Solution 48

I have spent about one day on this functional equation, despite the fact that I had done hundreds of functional equations.

We see f(x3)=f(x)2f(x^{3})=f(x)^{2}. Further plugging x=1,0,1x=-1,0,1, we get y2y=0y^{2}-y=0 has three solutions, namely f(1),f(0),f(1)f(-1),f(0),f(1). Hence two of these have to be equal. Suppose, for example, f(1)=f(1)f(-1)=f(1). Then, since w(f(x))=x3w(f(x))=x^{3}, we have 1=1-1=1. Similarly, by checking the cases f(1)=f(0)f(-1)=f(0) and f(0)=f(1)f(0)=f(1), we conclude that there are no functions f,wf,w such that f(w(x))=x2f\big(w(x)\big)=x^2 and w(f(x))=x3w\big(f(x)\big)=x^3.

Now, define f(x)=exp(ln(x))f(x)= \exp(\sqrt{\ln(x)}), w(x)=exp(4ln(x)2)w(x)=\exp(4\ln(x)^{2}), for all x>1x>1, for x=1x=1, f(1)=w(1)=1f(1)=w(1)=1, for 0<x<10<x<1, f(x)=exp(ln(x))f(x)=\exp(\sqrt{-\ln(x)}), w(x)=exp(4ln(x)2)w(x)=\exp(-4\ln(x)^{2}), f(0)=w(0)=0f(0)=w(0)=0, and f(x)=f(x)f(x)=f(-x), w(x)=w(x)w(x)=w(-x) for x<0x<0.

More functional equations?

Problem 61**

Find all functions f:R+R+f: \mathbb{R^{+}} \to \mathbb{R^{+}} satisfying f(xy)=f(x)f(y)f(x^{y})=f(x)^{f(y)}.
Reply 447
Original post by Star-girl
Problem 14**

Prove that 26012^{60}-1 is divisible by 61.


don`t know if anyone has solved this and, i`ve been unable to find a direct proof - which really annoys me. Here`s my best attempt (forgive me please, i`ve left it here or i`ll go nuts):

26012^{60}-1

can be factorised using the formula for a^n-1^n.

One of the factors is:

216+2142102826+5=1321×612^{16}+2^{14}-2^{10}-2^{8}-2^{6}+5=1321 \times 61

i know! i know! but, i can now unclench my hair and stop grinding my teeth and move on!
Original post by Hasufel
don`t know if anyone has solved this and, i`ve been unable to find a direct proof - which really annoys me. Here`s my best attempt (forgive me please, i`ve left it here or i`ll go nuts):

26012^{60}-1

can be factorised using the formula for a^n-1^n.

One of the factors is:

216+2142102826+5=1321×612^{16}+2^{14}-2^{10}-2^{8}-2^{6}+5=1321 \times 61

i know! i know! but, i can now unclench my hair and stop grinding my teeth and move on!


:biggrin:

There has been a solution that's different to yours but both are equally valid. :smile: See the first post in the thread, there is a link to it there (yours will probably be added in soon as well).

The question is a lot easier with a handy little tool called modular arithmetic and even easier of you know a result called Fermat's Little Theorem. You have provided a more accessible solution. :smile:
(edited 11 years ago)
Reply 449
Original post by Star-girl
:biggrin:

There has been a solution that's different to yours but both are equally valid. :smile: See the first post in the thread, there is a link to it there (yours will probably be added in soon as well).

The question is a lot easier with a handy little tool called modular arithmetic and even easier of you know a result called Fermat's Little Theorem. You have provided a more accessible solution. :smile:


thanks! Didn`t see the other solution - will check it out - thank again for the comment!
Original post by Hasufel
thanks! Didn`t see the other solution - will check it out - thank again for the comment!


No problem. :hat2:
Original post by Star-girl
:biggrin:
You have provided a more accessible solution. :smile:


* Better. None of the number theory nonsense :tongue:
Original post by bananarama2
* Better. None of the number theory nonsense :tongue:


This is a thread full of mathematicians... careful what you say. :wink:

Also, number theory is pretty awesome. :pierre:
Original post by Star-girl
This is a thread full of mathematicians... careful what you say. :wink:

Also, number theory is pretty awesome. :pierre:


I like to live dangerously.

(+μ2)ψ=0 (\square + \mu ^2 ) \psi =0

Look at that beauty.

Edit: It won't let me put put the D'alembert symbol.
(edited 11 years ago)
I haven't seen very many inequality questions around, so I'll throw some in.

Problem 62*

Show that if p>m>0,p>m>0, then

pmp+mx22mx+p2x2+2mx+p2p+mpm, xR\dfrac{p-m}{p+m} \leq \dfrac{x^2-2mx+p^2}{x^2+2mx+p^2} \leq \dfrac{p+m}{p-m} ,\ \forall x \in \mathbb{R}

Problem 63*

Prove x,y,z,w, x2+y2+z2+w2+1x+y+z+w\forall x,y,z,w, \ x^2+y^2+z^2+w^2+1 \geq x+y+z+w
Solution 63

x,y,z,w, x2+y2+z2+w2+1x+y+z+w\forall x,y,z,w, \ x^2+y^2+z^2+w^2+1 \geq x+y+z+w

    x2x+y2y+z2z+w2w1 \iff \displaystyle x^2-x+y^2-y+z^2-z+w^2-w \geq -1

    (x12)214+(y12)214+(z12)214+(w12)2141 \iff (x-\frac{1}{2})^2 -\frac{1}{4} + (y-\frac{1}{2})^2 -\frac{1}{4} + (z-\frac{1}{2})^2 -\frac{1}{4} + (w-\frac{1}{2})^2 -\frac{1}{4} \geq -1

    (x12)2+(y12)2+(z12)2+(w12)20\iff (x-\frac{1}{2})^2 + (y-\frac{1}{2})^2 + (z-\frac{1}{2})^2 + (w-\frac{1}{2})^2 \geq 0

Which is true since a square is equal greater than one.
(edited 11 years ago)
Original post by bananarama2
I like to live dangerously.

Unparseable latex formula:

(\box + \mu ^2 ) \psi =0



Look at that beauty.

Edit: It won't let me put put the D'alembert symbol.


Why not use \square
Original post by Dark Lord of Mordor
Why not use \square


:pierre: One does not simply use a square.

Spoiler

(edited 11 years ago)
Original post by Star-girl
:biggrin:

There has been a solution that's different to yours but both are equally valid. :smile: See the first post in the thread, there is a link to it there (yours will probably be added in soon as well).

The question is a lot easier with a handy little tool called modular arithmetic and even easier of you know a result called Fermat's Little Theorem. You have provided a more accessible solution. :smile:


I have another solution that I'm quite happy with so I thought I'd post it on here:

2601=12(2612)=12((611)+(612)+(613)+...+(6160)) 2^{60} - 1 = \frac{1}{2}(2^{61} - 2) = \frac{1}{2}(\displaystyle \binom{61}{1} + \displaystyle \binom{61}{2} + \displaystyle \binom{61}{3} + ... + \displaystyle \binom{61}{60} )

The bracket is divisible by 61, as 61 is prime, and divisible by 2 since only 61C1 and 61C60 are odd, due to the otherwise everpresent factor of 60. Hence:

2601 2^{60} -1 is divisible by 61.
(edited 11 years ago)
Original post by Star-girl
I haven't seen very many inequality questions around, so I'll throw some in.

Problem 62*

Show that if p>m>0,p>m>0, then

pmp+mx22mx+p2x2+2mx+p2p+mpm, xR\dfrac{p-m}{p+m} \leq \dfrac{x^2-2mx+p^2}{x^2+2mx+p^2} \leq \dfrac{p+m}{p-m} ,\ \forall x \in \mathbb{R}

Problem 63*

Prove x,y,z,w, x2+y2+z2+w2+1x+y+z+w\forall x,y,z,w, \ x^2+y^2+z^2+w^2+1 \geq x+y+z+w


Why does the first one seem so familiar? :pierre:

Quick Reply

Latest