Suppose I measure reaction time of 4 students, initially before any treatment, then after treatment 1, and finally after treatment 2. (Note all treatments will eventually be applied to all students)
Also because of potential error with reaction time measurements, suppose 3 trials are done for ea...
Suppose I measure reaction time of 4 students, initially before any treatment, then after treatment 1, and finally after treatment 2. (Note all treatments will eventually be applied to all students)
Also because of potential error with reaction time measurements, suppose 3 trials are done for ea...
I once read that one of the major evolutionary reasons man's brain is larger than apes is that we had to remember where we kept our food. Just some food for thought :-)
@Mew, In am exam, the score in each of the 4 subjects A,B,C and D - can be integer between 0 and 10. Then number of ways in which a student can secure a total of 21 is 880. I can find that with finding coefficient of $x^{21}$ in $(1+x+\dots+x^9+x^{10})^4$
But is there an easier way? As the question had only 2 marks!
@skullpatrol, i kept my food in refrigerator! lol:-)
@Mike. Just emailed my lecturer about the metric we talked about. His response: "Yes, I had intended that you use the d_\infty metric on C(T)...I should have been clearer on that."
There was a metapost that suggested it was worth bringing up to a moderator, otherwise I wouldn't have mentioned it, but I'll just drop the matter. Thanks
Suppose I measure reaction time of 4 students, initially before any treatment, then after treatment 1, and finally after treatment 2. (Note all treatments will eventually be applied to all students)
Also because of potential error with reaction time measurements, suppose 3 trials are done for ea...
but the professor is good for that course so it's going to be worth getting up
just like last semester...there was this really cool professor who replaced someone else at the last minute. I don't know why the class didn't like him...he's knowledgeable and totally awesome...and... hehheehe ^^
so, i need to prove that for n>=2, and for any positive integer k, (n-1) | (n^k - 1 ) , i have proved doing induction on k ( starting with base k=1 ).. Do i need to do something else about n ? Do i need to do induction on n now with k fixed ? im kinda confused with two-variable inductions
draw a right angled isosceles triangle .. and draw lines parallel to the hypotenuse .. you will get cyclic trapezoids with angles of 45, 45, 135, 135 .. that has diagonal angle varying fron 90 to 180 degrees :)
Statement : gcd( gcd(a,b) , b) = gcd(a,b) . I understand this perfectly by intution, and i can also prove by showing that every integer d that divides gcd(a,b) and b , must divide a and b, also the converse. My problem is by proving that with Bezout identity.
How can i make the fact that i can find x,y s.t ax + by = d, imply into the fact that there exists xo.yo such that d.xo + byo = (ax + by).xo + byo = a(x.xo) + b(yo + yxo) = d ? How do i prove that if x,y are minimal for a,b so is x.xo and yo + yxo ?
hmm thats nice, so the outline is to prove that we know bezout coeficients (1,0) for c = xo(gcd(a,b) ) + yo.b are minimal because if they weren't minimal, say leading to c > gcd(a,b) then we would have that gcd(a,b) wouldn't divide c, which is absurd
my problem is really about logic, to prove gcd(gcd(a,b),b) = gcd(a,b), dont we need to prove that gcd(gcd(a,b),b) = d implies gcd(a,b) = d and gcd(a,b) = d implies gcd(gcd(a,b),b) = d ?
@nerdy If you want to prove gcd(gcd(a,b),b)=gcd(a,b), an equivalent statement is: Given d=gcd(a,b), prove that gcd(d,b)=d. The latter is easy since d divides b, as shown above.
There are so many complex-analysis subscribers on this site. It would be nice if someone could properly answer this question, as the 2 answers given so far fail to achieve the goal. I could adapt Apostol's proof, but that is not something I would like to do.
I guess its just some logic gap i have, i posted here math.stackexchange.com/questions/743478/…. By the way, your avatar is the graph of a complex function, isnt it ? So beautiful :D