If c > 1, prove that its n^th root is greater than 1 too

  • MHB
  • Thread starter issacnewton
  • Start date
  • Tags
    Root
In summary, the conversation is about proving that if c > 1, then c^(1/n) > 1 for n ∈ ℤ. The proof uses the n^th root theorem and properties of real numbers to show that c^(1/n) > 1. The speaker has not tried using induction in their proof and asks if it is correct.
  • #1
issacnewton
1,041
37
HelloI am trying to prove that if $c > 1$, then $c^{1/n} > 1$ , where $n\in \mathbb{N}$.
Now I present my proof here. Since $c>1$, it follows that $c > 0$. Now
$n^{\mbox{th}}$ root theorem says that if $a>0$,then there exists a unique positive
$n^{\mbox{th}}$ root of $a$. So $c^{1/n} > 0 $. Since we have to prove that $c^{1/n} > 1$ ,
I assume the negative of this goal. Assume $c^{1/n} \leqslant 1$. If $c^{1/n} = 1$, it
immediately follows that $c=1$, which leads to contradiction. So assume that
$c^{1/n} < 1$. Since $c^{1/n} > 0 $, we have that $0 < c^{1/n} < 1$. If $n=1$, we get
$c<1$ which is contradiction. Now I use a property of real numbers which I have
already proved. If $0<b<1$, and $n>1$, it follows that $b^n < b$. So for $n>1$,
letting $b = c^{1/n}$ , we get that $ (c^{1/n})^n < c^{1/n}$, which is
$c < c^{1/n}$. But since we assumed that $c^{1/n} < 1$, it follows that $c<1$ , which
contradicts our premise that $c>1$ . Hence $c^{1/n} \nleqslant 1$. So we prove that
$c^{1/n} > 1$.
Is this proof OK ?Furthermore, given $a>1$, I have proved that $a^n > a$ for $n>1$. So plugging, $a = c^{1/n}$,
we can arrive at conclusion that $(c^{1/n})^n > c^{1/n}$. So we can conclude that
$1< c^{1/n} < c $ if $n>1$

(Emo)
 
Physics news on Phys.org
  • #2
IssacNewton said:
I am trying to prove that if $c > 1$, then $c^{1/n} > 1$ , where $n\in \mathbb{N}$.
Now I present my proof here. Since $c>1$, it follows that $c > 0$. Now
$n^{\mbox{th}}$ root theorem says that if $a>0$,then there exists a unique positive
$n^{\mbox{th}}$ root of $a$. So $c^{1/n} > 0 $.

Have you tried to use induction ?
 
  • #3
No, I have not tried induction. It could be used here. But is this proof correct ?
 

FAQ: If c > 1, prove that its n^th root is greater than 1 too

What is the significance of c being greater than 1 in this statement?

By definition, the n^th root of a number is a value that, when multiplied by itself n times, equals the original number. Therefore, if c is greater than 1, it means that the number is already greater than 1 and therefore has a positive n^th root.

How does the value of c affect the value of its n^th root?

If c is greater than 1, it means that the number has a positive n^th root. This means that the n^th root of c is a number that, when multiplied by itself n times, equals c. Therefore, the value of c directly affects the value of its n^th root.

What is the proof that the n^th root of c is greater than 1 if c is greater than 1?

The proof for this statement follows from the definition of a positive n^th root. Since c is greater than 1, it means that the n^th root of c is a positive number. In other words, the n^th root of c is a number that, when multiplied by itself n times, will equal c. Therefore, the n^th root of c must be greater than 1.

Is this statement always true for all values of c and n?

Yes, this statement is always true for all values of c greater than 1 and for all positive integer values of n. This can be proven using mathematical induction, where it can be shown that for any n, if c is greater than 1, then the n^th root of c will also be greater than 1.

How can this statement be applied in real-world situations?

This statement can be applied in various real-world situations, such as in finance, where it can be used to calculate compound interest. In scientific experiments and data analysis, the n^th root of a number can be used to find the average value of a dataset. Additionally, this statement can be used in engineering to determine the required size of components in a system.

Similar threads

Back
Top