Search results

Proof: RESULT 1: consider the situation where 1.) there are 2^n persons still in the game (n is integer) 2.) the first person(who is about to pass) has 2 or more coins 3.) the person about to pass is to pass 1 coin to the next person 4.) everyone except the person who is about to...

{x: x= 2^n + 1 } I will write up the proof tomorrow. outline: basically after 1 round (last person gets his 2 coins) the configuration would be something like: 3,2,2,2,2,2,2,2,2,....2 in a circle and 2^(n-1) persons altogether. and the guy with 3 coins is to pass 1 to the next guy...

underthesun, freaking out: ... Freeware from Shamus Software, Dublin, Ireland Full C source code and MIRACL multiprecision library available Email to mscott@indigo.ie for details Web page http://indigo.ie/~mscott Source code from ftp://ftp.compapp.dcu.ie/pub/crypto/miracl.zip...

hmm how about the cambridge book? have you heard of that one? it's exactly the same as 'arnold'

What about the Goldbach conjecture

no, this is a combinatorics question, so the first person doesn't get out automatically, and a person only gets out if he/she has only 1 penny and have to pass 2? so he/she passes the penny to the next person and gets out? and in this case does the person who received 1 penny pass 1 or 2...

MyLuv, the one you've posted is the cauchy-schwarz in general it's [Sum {i=1 to n} [a(i)]^2 ][Sum {i=1 to n} [b(i)]^2 ] >=[Sum {i=1 to n} [a(i)b(i)] ]^2 you can prove it by considering the discriminant of the quadratic Sum {i=1 to n} [a(i)x + b(i)]^2

we have about a week. :-P

thanks dudes/dudettes

hmm you skipped a year? I was in year 10 in 2001

master means.. master.. like 90+ new concepts in 4U( compared to 3U): oblique asymtopes for graph sketching Complex numbers hmm.. should be the easy check the HSC hints conics might take you a while, quite some things to memorize there such as the coordinates of the focii, the 2...

scan through this board, most questions here are here because someone found it hard.

seriously, master 3U, read a 4U textbook, do no exercises...

method 1 gradient bash: find gradients of teh two lines from focii to the point find gradient of ellipse at the point use the tan(@) =| (m1 - m2)/1 + m1m2 | formula method 2 'smart' way: prove SP + SP' = 2a for any point P on teh ellipse show that the sum of distances SQ + QS'...

no if these marks will reflect your HSC marks 75 for business studies and mathematics is a real problem,

I heard that joke n times from my teacher... where 1/n tends to 0

the only way some person could justify leaving early is getting 100 for the subject

"don't you get 15K a year at USyd if u get 100 or .95?" no.. sydney is tight on scholarships

high 80s - low 90s? .. hmm really depends on your HSC exam..

ppl here need your rank, it tells more than your Mark