At 11/22/11 10:48 AM, laughatyourfuneral wrote:
i used to be best at math in my class but this year ive been sick alot and we switched math teacher from the
best iv'e ever had to an unlicensed teacher that couldn't count for shit and switched again to a pissed old man
so i almost failed the my last test also could someone give a general list of the general mathematical signs in the american (english where ever its from) and what they're called, i only know the swedish system and even though the "system" is global there are some differences and these signs are alien to me
http://en.wikipedia.org/wiki/Mathematica l_symbol
could this be what you are looking for?
seeing this thread has received replies, i guess i will try to illustrate one common technique to solve basic math problems (especially in the olympiad).
pigeonhole principle: if we place n distinct elements into m different boxes, where n>m, then at least one of the box must contain more than 1 element.
proof: trivial.
example 1: suppose 51 distinct integers are chosen from the set {1,2,...100}. there exists at least a pair of numbers which do not have common prime divisor.
proof: group it into (1,2),...(99,100). since 51 numbers are chosen, because of pigeonhole principle, two consective integers must be chosen, say k, k+1. but it is impossible that a prime p divides both numbers and p>=2.
example 2: putnam (2002). show that if 5 points are chosen arbitary from a sphere, then at least four points must lie on the same hemisphere.
proof: draw a circle connecting any of the two points. since there are only two hemispheres to contain the other three points, the result is a direct consequence of pigeonhole principle.
questions:
1. prove that the decimal representations of a rational number must be eventually periodic. (a rational number is a number that can be written in p/q, where p q are integers)
(for example: 1/4=0.2500000.....
1/7=0.142857142857...
15/26=0.57692307692307...) and so on.
hint: division algorithm.
2. consider any nine points in three dimension space, all of which have integer coordinate. prove that at least one line segment with end points selected from the nine points must contain a third point with integer coordinates.
hint: think about the condition for both endpoints.