Simple analysis proof: x^n -> a^n as x -> a

  • Thread starter Thread starter applegatecz
  • Start date Start date
  • Tags Tags
    Analysis Proof
applegatecz
Messages
14
Reaction score
0

Homework Statement


Prove that x^n approaches a^n as x approaches a.


Homework Equations





The Attempt at a Solution


I understand the concept here ... need to find a delta>0 for epsilon>0 s.t. |x-a|<delta implies |x^n-a^n|<epsilon. For some reason I can't solve this one. Thanks.
 
Physics news on Phys.org
You know you can factor x^n-a^n=(x-a)*(x^(n-1)+x^(n-2)*a+ ... + a^(n-1)), right?
 
Oh! Somehow I missed that. Thank you very much for your help.
 
Dick assumes n is a positive integer, which you did not tell us under "all variables and given/known data" ... so are we to assume n is NOT know to be a positive integer?
 
still, how do you show that (x^(n-1)+x^(n-2)*a+ ... + a^(n-1)) is < epsilon?
 
You don't, and no one has claimed it is. You want |x^n- a^n|= |x- a||x^{n-1}+ ax^{n-2}+ ...+ a^{n-1}|&lt; \epsilon for |x- a| small enough. That is the same as choosing |x- a|&lt; \epsilon/|x^{n-1}+ ax^{n-2}+ ...+ a^{n-1}| and you can do that by finding any positive lower bound on |x^{n-1}+ ax^{n-2}+ ...+ a^{n-1}| for x close to a.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top