The Student Room Group

Scroll to see replies

Original post by chickenonsteroids
Good luck :smile: I'm sure you'll get 101% :yep:


Thanks, all the mocks I have had so far I have been getting As in (wooo) but apparently it is really hard. :afraid:

But thanks!
Original post by wcp100
Also i=1n(aix+bi)2 \displaystyle \sum_{i=1}^n ( a_i x +b_i )^2

Determine the conditions for the roots of the quadratic in x.


I'm actually rather tired but I'll have a go (sorry if I take forever :sad: ). :smile:
Original post by Maths_Lover

Good luck! :biggrin:


Thanks. :colone::colone::colone:

Withdrawal symptoms from not going on skype. :nooo: Must. Refrain.
Original post by Heptapus
Thanks. :colone::colone::colone:

Withdrawal symptoms from not going on skype. :nooo: Must. Refrain.


You are welcome. :hugs:

Don't do it! :nooo:
Original post by wcp100
Let the games maths begin.

The Complete University Guide

Spoiler



Do you want the list from Mark V?

If so:

Spoiler

Reply 385
Original post by Appeal to reason
Do you want the list from Mark V?

If so:

Spoiler



Thanks!
Distance equals speed times time, not the other way round. Silly me.

Part one done!
Original post by wcp100
Also i=1n(aix+bi)2 \displaystyle \sum_{i=1}^n ( a_i x +b_i )^2

Determine the conditions for the roots of the quadratic in x.


So far I have:

(a1b1+a2b2+a3b3++anbn)2(a12+a22+a32++an2)(b12+b22+b32++bn2)(a_1b_1+a_2b_2+a_3b_3+\cdots +a_nb_n)^2 \geq (a_1^2+a_2^2+a_3^2 + \cdots + a_n^2)(b_1^2+b_2^2+b_3^2 + \cdots + b_n^2)

Upon multiplying out and saying that the discriminant must be greater than or equal to zero, then simplifying and rearranging...

It looks like the Cauchy-Schwarz inequality but with the inequality sign the other way round. :holmes:
(edited 11 years ago)
Reply 388
Original post by Maths_Lover
So far I have:

(a1b1+a2b2+a3b3++anbn)2(a12+a22+a32++an2)(b12+b22+b32++bn2)(a_1b_1+a_2b_2+a_3b_3+\cdots +a_nb_n)^2 \geq (a_1^2+a_2^2+a_3^2 + \cdots + a_n^2)(b_1^2+b_2^2+b_3^2 + \cdots + b_n^2)

Upon multiplying out and saying that the discriminant must be greater than or equal to zero, then simplifying and rearranging...

It looks like the Cauchy-Schwarz inequality but with the inequality sign the other way round. :holmes:


The inequality is the wrong way around....

What makes you think the roots are real?
Original post by Libris Dedita
Distance equals speed times time, not the other way round. Silly me.

Part one done!


We've all made silly mistakes today! :tongue:

Fantastic. :smile:
Original post by wcp100
The inequality is the wrong way around....

What makes you think the roots are real?


Damnit...

I dunno actually... I sort of made an assumption there, didn't I? :emo:
Reply 391
Original post by Maths_Lover
Damnit...

I dunno actually... I sort of made an assumption there, didn't I? :emo:


Well. We know that the function is always equal or greater than one, so what does this imply about the roots?
Original post by wcp100
Well. We know that the function is always equal or greater than one, so what does this imply about the roots?


They are complex. :facepalm:
Original post by wcp100
Also i=1n(aix+bi)2 \displaystyle \sum_{i=1}^n ( a_i x +b_i )^2

Determine the conditions for the roots of the quadratic in x.


(a1b1+a2b2+a3b3++anbn)2<(a12+a22+a32++an2)(b12+b22+b32++bn2)(a_1b_1+a_2b_2+a_3b_3+\cdots +a_nb_n)^2 < (a_1^2+a_2^2+a_3^2 + \cdots + a_n^2)(b_1^2+b_2^2+b_3^2 + \cdots + b_n^2)

Thanks for the hint. :smile:
(edited 11 years ago)
Reply 394
Original post by Maths_Lover
(a1b1+a2b2+a3b3++anbn)2<(a12+a22+a32++an2)(b12+b22+b32++bn2)(a_1b_1+a_2b_2+a_3b_3+\cdots +a_nb_n)^2 < (a_1^2+a_2^2+a_3^2 + \cdots + a_n^2)(b_1^2+b_2^2+b_3^2 + \cdots + b_n^2)

Thanks for the hint. :smile:


I thought that proof was rather nice:tongue:
Original post by Maths_Lover
You are welcome. :hugs:

Don't do it! :nooo:


Trying. :nooo:
Ok... now I will start with maths
Original post by wcp100
I thought that proof was rather nice:tongue:


It is! Thanks, that is a useful one. :biggrin:
Original post by chickenonsteroids
Ok... now I will start with maths


:woo:
Kind of off-hand, but did any of you do the BMO (round one or two) this year/ last year?

You do seem to be quite... taken with maths in that way :smile:

Latest