Proving a^n/p(n) Tends to Infinity with n

  • Context: Graduate 
  • Thread starter Thread starter dichotomy
  • Start date Start date
  • Tags Tags
    Infinity
Click For Summary

Discussion Overview

The discussion revolves around proving that the expression a^n/p(n), where p is any polynomial and a>1, tends to infinity as n increases. Participants explore various mathematical approaches and techniques to extend a previously established result regarding a^n/n^k to a complete polynomial.

Discussion Character

  • Exploratory
  • Technical explanation
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant has shown that a^n/n^k tends to infinity but is unsure how to extend this to a complete polynomial.
  • Another participant points out a potential misuse of the variable 'a' and suggests using the triangle inequality to aid in the proof.
  • Some participants propose changing n^k to (n+b)^k to prove the result, but express uncertainty about the validity of this approach.
  • There is a suggestion to prove that the reciprocal tends to zero, which has been previously used successfully by one participant.
  • Another participant mentions the ratio test for convergence but encounters complications when applying it to polynomials.
  • One participant discusses the nth root test and derives a conclusion about divergence, although they express doubt about their method due to not using the triangle inequality.
  • Concerns are raised about the correctness of a derived expression involving a/p(n)^{1/n} and its implications for a=1.
  • Another participant emphasizes the importance of using the triangle inequality to analyze the polynomial's behavior as n approaches infinity.
  • There is a discussion about orders of magnitude and the use of logarithmic functions to analyze the limit behavior of the expressions involved.

Areas of Agreement / Disagreement

Participants express various viewpoints and approaches, with no consensus reached on the best method to prove the original statement. Multiple competing views remain regarding the application of different mathematical techniques.

Contextual Notes

Some participants note limitations in their approaches, such as the dependence on specific definitions or the need for further proof when adding terms of different powers of n. There are unresolved mathematical steps and assumptions that could affect the validity of the arguments presented.

dichotomy
Messages
24
Reaction score
0
i've to show (as part of a bigger assignment) that

a^n/p(n), where p is any polynomial and a>1, tends to infinity as n does. I've proved that:

a^n/n^k

does so, but I'm not sure how to extend this to a complete polynomial such as

(c1)n+(c2)n^2+(c3)n^3...

thanks for any help

NB: edited
 
Last edited:
Physics news on Phys.org
You've used a for two different things; and forgotton a condition on the first a.

Remember the triangle inequality:

|x+y| <= |x|+|y|

that will help.
 
right...well all i can think of at the moment is changing (n^k) to (n+b)^k and prove that it works for that - however i don't think that's valid since (i don't think) every possible polynomial can be created by such an expansion.

i've not a clue where to start with the triangle inequality
 
Try proving the reciprical tends to zero, then you can just add different powers of n in the numerator.
 
proving the reciprocal goes to zero is exactly how i did a^n/n^k...

but i didn't think you could just add terms in various powers of n and expect the same result as a^n/n^k (or its reciprocal) without proving it?
 
Last edited:
also, i think all that is needed is the ratio test for convergence (of the reciprocal) however if I use this when I replace n^k with (b+n)^k (to create the polynomial), i end up with series within series, and I'm not sure what to do with that.

(The ratio test is also what i used for a^n/n^k)
 
The nth root test, where you take the nth root as n approaches infinity.

For the numerator, you get (a^n)^(1/n) as n approaches infinity. The powers equate leaving us with just a. The denominator, it becomes p(n)^(1/n) as n approaches infinity. so in the end we get a*p(n)^n. As n approaches infinity, the polynomial will as well. So the result of our nth root test is more than 1. That means it does not converge, and therefore diverges. As n approaches inifinity, both a^n and p(n)^n will be positive, meaning it diverges positively, to infinity.

Note: I didnt use that triangle inequality that matt grime posted, which makes me think i may have done something wrong lol, matt grimes always right...
 
Last edited:
There is always more than one way to skin cat. However, you have asserted that

a/p(n)^{1/n} = a*p(n)^n

which is not correct. Your 'proof' also works for a=1, which is unfortunate, as 1/p(n) tends to zero as n tends to infinity.
 
The hint was to use the triangle inequality. I don't see anyone doing that. Try to use the triangle inequality to go from studying p(n) to a k*n^r, where k is a constant and r is the degree of p(n) (and no, k is not the coeffeicient of n^r in p(n)).
 
  • #10
dichotomy said:
proving the reciprocal goes to zero is exactly how i did a^n/n^k...

but i didn't think you could just add terms in various powers of n and expect the same result as a^n/n^k (or its reciprocal) without proving it?

That is what the triangle inequality will let you do - You can replace

[tex]| b_r n^r + b_{r-1}n^{r-1} + \ldots b_0|[/tex]

with something larger. Notice that n^r > n^{r-1} for n>1, r>2.
 
  • #11
do you mean:

[tex]| b_r n^r + b_{r-1}n^{r-1} + \ldots b_0| \leq |n^r + n^r + n^r + \ldots \mbox{(to the extent of k)}|[/tex]

which only is true if

[tex]b_{r-s} < n^s \mbox{ and } \ k=r[/tex] where s=1,2,3...

but the coefficients of [tex]n^{r-s}[/tex] are going to be much smaller than any possible value of [tex]n^{r-s}[/tex] once n approaches infinity, such that the first condition can be ignored?

nb: only just started with latex so bear with me...
 
Last edited:
  • #12
What are you using k to mean? Not what I used it to mean.
 
  • #13
ahh damn i knew i must have stuffed something up, couldn't have been that simple that someone else didnt see...ahh o well
 
  • #14
You are talking about orders of magnitude. First, we prove that a^x/ x tends to infinity as x increases beyond all bounds. Consider the function f(x) = log [a^x/ x] = x log a - log x. Surly if we prove that if f(x) goes to infinity, we prove that a^x/ x goes to infinity as well. Now let us consider f'(x) = log a - 1/x. Now for x>c, we have f'(x)>1/2 log a. Let us define g'(x) = 1/2 log a. By the principles of integral,

f(x) - f(c) > g(x) - g(c).f(x) - f(c) > (x-c)*1/2 log a

f(x) > (x-c)*1/2 log a + f(c)

Clearly the right expression goes to infinity as x increases. Thus we have proved that f(x) goes to infinity as well.

Now we have a polynomial of power n and a x^n+1. If p(x) remains positive past a certain point, the expression x^n+1/p(x) goes to infinity - this can be proven using Hopital's law. Now

a^x/p(x) = [a^x/x^n+1]*[x^n+1/p(x)].

We need only to prove that a^x/x^n+1 has a positive limit or is unbounded in order to prove the statement that a^x/p(x) goes to infinity as x increases. We consider, the n+1 th root of the expression that is,

a^x/n+1 / x

This can be rewritten as

1/n+1 * [a^x/n+1 / (x/n+1)]

Putting x/n+1 = y, we have

1/n+1 * [a^y / y]

As was shown, a^y/y goes to infinity as y increases. Thus, the n+1 th root goes to infinity and a^x/x^n+1 goes to infinity as well. Finally, a^x/p(x) goes to infinity.
 
Last edited:

Similar threads

  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 16 ·
Replies
16
Views
3K
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 29 ·
Replies
29
Views
6K