Let and be points on a plane such that , where is a positive integer. Let be the set of all points such that , where is a real number. The path that traces is continuous, and the value of is minimized. Prove that is rational for all positive integers
When i search the china TST 2017 problem 6 day I i crossed out this lemme, but don't know to prove it, anyone have suggestion? tks
Given a fixed number n, and a prime p. Let f(x)=(x+a_1)(x+a_2)...(x+a_n) in which a_1,a_2,...a_n are positive intergers. Show that there exist an interger M so that 0<v_p((f(M))< n + v_p(n!)
Discover IMPSC 2025: International Math & Physics Summer Camp!
Are you a high school student (grades 9–12) with a passion for Physics and Math?
Join the IMPSC 2025, an online summer camp led by top IIT professors, offering a college-level education in Physics and Math.
What Can You Expect?
Learn advanced topics from renowned IIT professors
Connect with students worldwide
Strengthen your college applications
Get a recommendation letter for top universities!
How to Apply & More Info
For all the details you need about the camp, dates, application process, and more, visit our official website:
https://www.imc-impea.org/IMC/index.php
Don't miss out on this opportunity to elevate your academic journey!
Apply now and take your education to the next level.
Is there a way to prove
\frac{1}{(1+1)!}+\frac{2}{(2+1)!}+...+\frac{n}{(n+1)!}=1-\frac{1}{{n+1)!}
without induction and using only combinatorial arguments?
We let the circle equation be . We can solve for : Due to tangency, there is only one solution of , and we have a double root and @rchokler's solution 2 is also algebraic and works well.
This post has been edited 1 time. Last edited by joeym2011, Apr 12, 2025, 12:26 AM
We set two equations: Substituting into the second equation yields Expanding gives Combining like terms, we get We know that there are only two solutions that are negations of each other, so Since we want the roots to be negations of each other, the discriminant is equal to So, we need Solving for gives
This post has been edited 4 times. Last edited by ReticulatedPython, Apr 12, 2025, 12:35 AM
We set two equations: Substituting into the second equation yields Expanding gives Combining like terms, we get We know that there are only two solutions that are negations of each other, so Since we want the roots to be negations of each other, the discriminant is equal to So, we need Solving for gives
This is exactly the method I used .
If you don't understand the meaning of this sentence " Since we want the roots to be negations of each other, the discriminant is equal to " , I'll explain it more :
If the discriminant were then the equation would have 2 different solutions for ( because the discriminant is positive ) , that means four 4 points of tangency which is not true .
This post has been edited 2 times. Last edited by mathmax001, Apr 12, 2025, 7:41 PM Reason: addendum
Since , and the equation of the circle we have is , we plug in to find that . Now, we can use the quadratic formula and get: , and since we want the discrimant to be , we just have that
also hi reticulated python!
also sorry for a bad sol
i didnt have time to explain everything clearly
This post has been edited 1 time. Last edited by jb2015007, Apr 12, 2025, 7:42 PM
The equation of the circle is . Subbing in to find the intersection gets which is now since, the circle only intersects the parabola twice there must be 2 double roots so we consider the determinant which is which becomes so only since the radius can't be negative.
Since , and the equation of the circle we have is , we plug in to find that . Now, we can use the quadratic formula and get: , and since we want the discrimant to be , we just have that
also hi reticulated python!
also sorry for a bad sol
i didnt have time to explain everything clearly