Difference between revisions of "KGS math club"
m |
|||
Line 26: | Line 26: | ||
|style="background-color:rgb(220,230,255);" | maproom | |style="background-color:rgb(220,230,255);" | maproom | ||
| The number of ways to choose k things from n (n>2k) is equal to the number of ways to choose n-k things. Find a general way to pair up the k-member subsets with the (n-k)-member subsets such that each of the former is a subset of its partner. | | The number of ways to choose k things from n (n>2k) is equal to the number of ways to choose n-k things. Find a general way to pair up the k-member subsets with the (n-k)-member subsets such that each of the former is a subset of its partner. | ||
− | |style="background-color:rgb(220,230,255);" |[[KGS math club/solution_11_2| solution ]] | + | |style="background-color:rgb(220,230,255);" |[[KGS math club/solution_11_2| solution]] by icewesel |
|- valign="top" | |- valign="top" | ||
Line 32: | Line 32: | ||
|style="background-color:rgb(220,230,255);" | maproom | |style="background-color:rgb(220,230,255);" | maproom | ||
| How many dissimilar ways are there to arrange five points in the plane such that there are only two distinct distances between pairs of the points? | | How many dissimilar ways are there to arrange five points in the plane such that there are only two distinct distances between pairs of the points? | ||
− | |style="background-color:rgb(220,230,255);" | [[KGS math club/solution_11_1| solution ]] | + | |style="background-color:rgb(220,230,255);" | [[KGS math club/solution_11_1| solution]] by Warfreak2 |
|- valign="top" | |- valign="top" |
Revision as of 15:44, 17 February 2011
A group of people on Kiseido Go Server Mathematics room.
The meaning of this page is to collect the problems posed there and save hints and solution suggestions. In order to write something, I'm afraid you need to register to the AoPS wiki first. After that you're good to go.
Adding problems should be quite straightforward with the copy-paste template in the wiki source. Please add <math>-tags (or dollar signs, it seems) where required, e.g. . Still, if you don't, somebody else will; all additions are appreciated.
Added | Author | Problem | Solutions
|
---|---|---|---|
2011-02-14 | warfreak2 | A regular tetrahedron formed from six thin sticks is completely infested with greenfly, which breed rapidly and spread along the sticks at 1mm per second. There are three ladybugs that can walk at up to 1.1 mm per second, eating the greenfly that they pass. How can they exterminate the greenfly? | |
Feb. 2011 | maproom | The number of ways to choose k things from n (n>2k) is equal to the number of ways to choose n-k things. Find a general way to pair up the k-member subsets with the (n-k)-member subsets such that each of the former is a subset of its partner. | solution by icewesel |
Jan. 2011 | maproom | How many dissimilar ways are there to arrange five points in the plane such that there are only two distinct distances between pairs of the points? | solution by Warfreak2 |
11.8.2010 | ghej | For the curve x^2 + x y + y^2 = 1, find the tangent that passes through the point (0,2). | solution |
19.8.2009 | royu | You have the set {9, 99, 999, ...}. Show that given any natural number n not divisible by 2 or 5, n divides at least one element of the set. | hint solution |
19.8.2009 | bourbaki | Suppose A and B are n x n matrices with real entries such that either A or B commutes with C = AB - BA. Prove that C is nilpotent, i.e. C^k = 0 for some integer k | solution |
18.7.2009 | taoyan | How many times do the clock hands (hour and minute) overlap between 11:59:59 before lunch and 00:00:01 at night? | solution |
27.7.2008 | royu StoneTiger | You have a collection of 11 balls with the property that if you remove any one of the balls, the other 10 can be split into two groups of 5 so that each weighs the same. If you assume that all of the balls have rational weight, there is a cute proof that they all must weigh the same. Can you find a proof? Can you find a way to extend the result to the general case where the balls have real weights? | solution |
6.7.2008 | amkach | Prove or disprove: If P(x) is a polynomial (with non-zero degree) of one real variable and a and b satisfy for all integers n > 0 (i.e., , etc.), then a = b | solution |
1.7.2008 | quimey | Assume and are integers and can be expressed as sum of squares (i.e, exists integers with . Show can be written as sum of squares. And the same but with squares. | solution |
30.6.2008 | amkach | For , consider the dimensional hypercube with side length centered at the origin of space. Place inside of it dimensional hyperspheres of radius , centered at each of the points . These hyperspheres are tangent to the hypercube and to each other.
Then place an dimensional hypersphere, centered at the origin, of size so that it is tangent to each of the hyperspheres of radius . In which dimensions is this central hypersphere contained within the hypercube? |
solution |
21.6.2008 | amkach | Consider the two player game that begins with an even length sequence of positive integers. Each player, in turn, removes either the first or last of the remaining integers, ending when all the integers have been removed. A player's score is the sum of the integers that they removed; the winner is the player with the higher score (with a tie if equal scores). Show that Player One has a non-losing strategy, i.e., can always force a tie or a win. | hints solution solution2 |
20.2.2007 | StoneTiger | Does any member of the sequence generated by ever have a factor in common with ? | sigmundur |
solution
|