Obligatory AMSP Week 1 Post
by djmathman, Jul 8, 2013, 1:16 AM
Darn, AMSP is hard.
Even though it's only been a week I've learned a good deal, including:
Here are some of the problems I've conquered on the worksheets and tests this week. If anybody knows the sources to these problems, let me know!
Solution
Solution
Solution
Solution
Solution
Solution
Even though it's only been a week I've learned a good deal, including:
- Don't let Nicky Sun steal your name tag on the first day; if he does, threaten him with push-ups later for an easy win
- Cosmin is too OP
Here are some of the problems I've conquered on the worksheets and tests this week. If anybody knows the sources to these problems, let me know!
Quote:
Let
be the number of
-tuples
with values in
and
for which the sum
is odd, and
the number of
-tuples for which the sum is even. Prove that
![\[\dfrac{O_n}{E_n}=\dfrac{2^n-1}{2^n+1}.\]](//latex.artofproblemsolving.com/0/6/1/06122299edef254ebcd50b02ddcddf246e04996a.png)








![\[\dfrac{O_n}{E_n}=\dfrac{2^n-1}{2^n+1}.\]](http://latex.artofproblemsolving.com/0/6/1/06122299edef254ebcd50b02ddcddf246e04996a.png)
Solution
We will not use induction.
LEMMA: For all positive integers
, we have ![\[\sum_{k\leq n, 2\nmid k}\dbinom nk 3^{n-k}=2^{2n-1}-2^{n-1}.\]](//latex.artofproblemsolving.com/6/e/6/6e6e9f9e02a65ceb1125c534f31d4cbf6ec51fe1.png)
Proof. Consider the binomial expansions of
and
. In the first one, all the terms are positive while in the second one, terms alternate between positive and negative. Hence, if we subtract the second expansion from the first, all of the terms with odd "degree" (i.e.
odd) will remain (and in fact be counted twice). So letting
be the LHS, we have
![\[2X=2^{2n}-2^n\implies X=2^{2n-1}-2^{n-1}.\qquad\blacksquare\]](//latex.artofproblemsolving.com/9/f/3/9f3e99af64d22e5c16dbd6def02c3b8a6ca835bf.png)
Let's count the number of
-tuples for which the sum is odd. Let
be a positive odd integer. In order for
, exactly
of the
must be equal to one and the rest must be equal to zero. If any
equals one, then there is only one pair
that satisfies the conditions
. Otherwise, there are three pairs to make
. Hence, the number of tuples that sum to
is
. Summing this over all odd positive integers less than or equal to
gives our desired. But note that from our lemma this is equal to
, so
. In a similar manner,
and our desired trivially follows. 
LEMMA: For all positive integers

![\[\sum_{k\leq n, 2\nmid k}\dbinom nk 3^{n-k}=2^{2n-1}-2^{n-1}.\]](http://latex.artofproblemsolving.com/6/e/6/6e6e9f9e02a65ceb1125c534f31d4cbf6ec51fe1.png)
Proof. Consider the binomial expansions of




![\[2X=2^{2n}-2^n\implies X=2^{2n-1}-2^{n-1}.\qquad\blacksquare\]](http://latex.artofproblemsolving.com/9/f/3/9f3e99af64d22e5c16dbd6def02c3b8a6ca835bf.png)
Let's count the number of
















Quote:
Let
be any positive integer. Show that ![\[\sum_{k=1}^n\dfrac{(-1)^{k-1}}k\dbinom nk=1+\dfrac12+\ldots+\dfrac1n.\]](//latex.artofproblemsolving.com/e/3/2/e32b682c54178b3583ba6375505321852e5a39bb.png)

![\[\sum_{k=1}^n\dfrac{(-1)^{k-1}}k\dbinom nk=1+\dfrac12+\ldots+\dfrac1n.\]](http://latex.artofproblemsolving.com/e/3/2/e32b682c54178b3583ba6375505321852e5a39bb.png)
Solution
We proceed by induction. The base case,
, is essentially trivial, and details are left to the interested reader. For the inductive step, it suffices to prove that
Splitting up the sum on the left and simplifying, we have
Now multiplying both sides by
and simplifying gives
Now it is not hard to show that this is true. In the interest of time, I will say that it is easy to move everything to one side and condense using Justin Stevens to show that it is true. 

![\[\sum_{k=1}^{n+1}\dfrac{(-1)^{k-1}}k\dbinom {n+1}k=\sum_{k=1}^n\dfrac{(-1)^{k-1}}k\dbinom nk+\dfrac1{n+1}.\]](http://latex.artofproblemsolving.com/3/4/2/342a2e2b5b0fec84047cb76c65ff359eff7d6cf9.png)
![\begin{align*}\sum_{k=1}^{n}\dfrac{(-1)^{k-1}}k\dbinom {n+1}k+\dfrac{(-1)^n}{n+1}&=\sum_{k=1}^n\dfrac{(-1)^{k-1}}k\dbinom nk+\dfrac1{n+1}
\\\sum_{k=1}^n\dfrac{(-1)^{k-1}}k\left[\dbinom{n+1}k-\dbinom nk\right]&=\dfrac{1-(-1)^n}{n+1}
\\\sum_{k=1}^n\dfrac{(-1)^{k-1}}k\dbinom n{k-1}&=\dfrac{1-(-1)^n}{n+1}.\end{align*}](http://latex.artofproblemsolving.com/f/b/8/fb830a057f884af1b5f9ee443251ef58c8a6a940.png)



Quote:
We are given
intervals on the real line. Prove that there either exist
intervals which are pairwise disjoint or
intervals with nonempty intersection.



Solution
Let the intervals be
. Define a poset
along these intervals with the equivalence relation
In this case, antichains are formed by pairwise disjoint intervals and chains are formed by intervals that are not pairwise disjoint. I shall first prove that there are either eight pairwise disjoint intervals or eight intervals which pairwise have nonempty intersection. Suppose not. Then the maximum length of both the chains and the antichains are both
. But by Dilworth this means that
, contradiction.
Now I shall prove that the eight intervals with pairwise nonempty intersection imply that these eight also have nonempty intersection "overall". Let these intervals be
,
, in "order". For each of the intervals
,
, that are greater than
, we have
. But since each intersects, we have
. Therefore
passes through each of the other seven intervals, and we are done. 


![\[A_i<A_j\text{ if } \min(A_i)<\max(A_j)\text{ and }A_i\cap A_j\neq\emptyset.\]](http://latex.artofproblemsolving.com/9/9/2/9926c0113dcbddd6ec365a165bf0a5a744fc4c5d.png)


Now I shall prove that the eight intervals with pairwise nonempty intersection imply that these eight also have nonempty intersection "overall". Let these intervals be









Quote:
Points
are chosen on the sides
respectively of a triangle
. Denote by
the centroids of triangles
,
,
respectively. Prove that the lines
,
,
are concurrent if and only if lines
are concurrent.











Solution
Let
be the midpoints of
,
,
respectively. It is clear that we no longer have to focus on the centroids but rather these midpoints. Note that by the Ratio Lemma,
We can derive similar equivalences concerning
and
. Multiplying all three ratios together and rearranging gives
Now it is clear that normal Ceva for
implies Trig Ceva for
, and vice versa, so we are done. 




![\[\dfrac{M_aC_1}{M_aB_1}=\dfrac{AB_1\sin\angle M_aAB}{AC_1\sin\angle M_aAC}=1.\]](http://latex.artofproblemsolving.com/2/d/1/2d13074917cc5c45beaea48dbf940f4dd68cc7b9.png)


![\[\left(\dfrac{AB_1}{AC_1}\cdot\dfrac{BC_1}{BA_1}\cdot\dfrac{CA_1}{CB_1}\right)\left(\dfrac{\sin\angle M_aAB_1}{\sin\angle M_aAC_1}\cdot\dfrac{\sin\angle M_bBC_1}{\sin\angle M_bBA_1}\cdot\dfrac{\sin\angle M_cCA_1}{\sin\angle M_cCB_1}\right)=1.\]](http://latex.artofproblemsolving.com/e/7/e/e7ed51791e1d7a404bcb3063d2c2210e224d4185.png)



Quote:
Let
be an isosceles triangle with
. Its incircle touches
in
and
in
. A line distinct of
goes through
and intersects the incircle in
and
. Line
intersects lines
ad
in
and
. Prove that
.
















Solution
We use Menelaus. Let
. Applyin Menelaus on
w.r.t line
gives
Similarly, applying Menelaus on
w.r.t line
givese
Multiplying these together and rearranging gives
Note that by PoP we have
and
. Hence the first two products vanish to
and all that's left is
Rearranging gives
Adding
to this equality gives
, as desired. 



![\[\dfrac{BE}{EX}\cdot\dfrac{XG}{GA}\cdot\dfrac{AL}{LB}=1.\]](http://latex.artofproblemsolving.com/0/0/3/003e6f8c9c8c0a11eba7ffcfc0f4e87c6d293339.png)


![\[\dfrac{BE}{EX}\cdot\dfrac{XF}{FA}\cdot\dfrac{AK}{KB}=1.\]](http://latex.artofproblemsolving.com/e/5/3/e53726a41921d4626630812a93f76f16eee9b0f0.png)
![\[\left(\dfrac{BE^2}{GA\cdot FA}\right)\left(\dfrac{XG\cdot XF}{EX^2}\right)\left(\dfrac{AL\cdot AK}{BL\cdot BK}\right)=1.\]](http://latex.artofproblemsolving.com/4/5/e/45e05fe6ca204313251fe4f514fcdb48607f3440.png)








Quote:
Let
be a triangle and let
and
be the squares erected on the sides which are directed towards the exterior of the triangle. Let
be the circumcenter of triangle
. Prov that
is the
-symmedian of triangle
.








Solution
Let
. Additionally, let the projections of
onto
and
be
and
respectively, and let the projections of
onto
and
be
and
respectively. Note that since
and
,
, and
. Similarly,
. This means that
Since the distances from
to
and
are in the same ratio as
to
are themselves,
lies on the
-symmedian of
, which is therefore
. 
















![\[\dfrac{YP}{YQ}=\dfrac{YP/YA}{YQ/YA}=\dfrac{AD/AX}{AE/AX}=\dfrac{AD}{AE}=\dfrac{AT}{AV}=\dfrac{AB}{BC}.\]](http://latex.artofproblemsolving.com/e/e/d/eedc8d28b43f64082683007628ca1e025632e6b3.png)










This post has been edited 6 times. Last edited by djmathman, May 31, 2020, 9:58 PM
Reason: never converted this post from the old site's format
Reason: never converted this post from the old site's format