Find the smallest positive integer n

In summary, finding the smallest positive integer n means finding the lowest whole number that is greater than zero, and it is important in mathematical and scientific applications as it serves as a starting point for counting, measuring, and solving problems. The process of finding the smallest positive integer n involves incrementing from 1 until the first number greater than zero is found. The smallest positive integer n is unique and significant in computer programming as it is used for loops, boundaries, data structures, and iterations.
  • #1
anemone
Gold Member
MHB
POTW Director
3,883
115
Find the smallest positive integer $n $ for which $n^{16}$ exceeds $16^{18}$.
 
Mathematics news on Phys.org
  • #2
anemone said:
Find the smallest positive integer $n $ for which $n^{16}$ exceeds $16^{18}$.
23 as below

n^16 > 16^18
or n^8 > 16^9 or 4^18
or n^4 > 4^9 or 2^18
or n^2 > 2^9 or 512
n = 22 => n^2 = 484 and n = 23 => n^2 = 529
 
  • #3
Hello, anemone!

[tex]\text{Find the smallest positive integer }n[/tex]
. . [tex]\text{ for which }n^{16}\text{ exceeds }16^{18}.[/tex]

kaliprasad is correct.
I used a different approach.

We want: .[tex]n^{16} \;> \; 16^{18}[/tex]

. . . . . . . .[tex]n^{16} \;>\; (2^4)^{18}[/tex]

. . . . . . . .[tex]n^{16} \;>\;2^{72}[/tex]

. . . . . . . . . [tex]n \;>\;2^{\frac{72}{16}}\;=\;2^{\frac{9}{2}}[/tex]

. . . . . . . . . [tex]n \;>\; 2^{4+\frac{1}{2}} \;=\;2^4 \cdot 2^{\frac{1}{2}}[/tex]

. . . . . . . . . [tex]n \;>\; 16\sqrt{2} \;=\; 22.627417[/tex]

Therefore: . [tex]n \;=\;23[/tex]

 
  • #4
soroban said:
Hello, anemone!


kaliprasad is correct.
I used a different approach.

We want: .[tex]n^{16} \;> \; 16^{18}[/tex]

. . . . . . . .[tex]n^{16} \;>\; (2^4)^{18}[/tex]

. . . . . . . .[tex]n^{16} \;>\;2^{72}[/tex]

. . . . . . . . . [tex]n \;>\;2^{\frac{72}{16}}\;=\;2^{\frac{9}{2}}[/tex]

. . . . . . . . . [tex]n \;>\; 2^{4+\frac{1}{2}} \;=\;2^4 \cdot 2^{\frac{1}{2}}[/tex]

. . . . . . . . . [tex]n \;>\; 16\sqrt{2} \;=\; 22.627417[/tex]

Therefore: . [tex]n \;=\;23[/tex]


above approach is more straight forward
 
  • #5


The smallest positive integer $n$ for which $n^{16}$ exceeds $16^{18}$ is $17$. This can be determined by setting up the inequality $n^{16} > 16^{18}$ and taking the 16th root of both sides, giving $n > 16^{18/16} = 16^{9/8}$. Since $16^{9/8} \approx 17.34$, the smallest integer that satisfies this inequality is $n = 17$. This result can also be verified by computing $17^{16} \approx 2.16 \times 10^{22}$ and $16^{18} \approx 4.61 \times 10^{22}$, showing that $n^{16}$ indeed exceeds $16^{18}$ for $n = 17$.
 

FAQ: Find the smallest positive integer n

What does it mean to find the smallest positive integer n?

Finding the smallest positive integer n means finding the lowest whole number that is greater than zero. It is the first number in the set of natural numbers and is often denoted as n = 1.

Why is finding the smallest positive integer n important?

Finding the smallest positive integer n is important in many mathematical and scientific applications. It is used to establish a starting point for counting, measuring, and solving problems. It also helps in identifying the smallest possible value in a given set of data.

How do you find the smallest positive integer n?

The process of finding the smallest positive integer n involves starting from the number 1 and incrementing it until you find the first number that is greater than zero. This can be done manually by counting or using mathematical operations such as addition or multiplication.

Can there be more than one smallest positive integer n?

No, there can only be one smallest positive integer n. This is because the set of natural numbers is ordered in a way that each number is greater than the previous one. Therefore, the smallest positive integer n will always be the first number in the set.

What is the significance of the smallest positive integer n in computer programming?

In computer programming, the smallest positive integer n is often used as an initial value or starting point for loops and arrays. It is also used in algorithms to establish a base case or boundary condition. Additionally, it is used to designate the size of data structures and to represent the number of iterations in a program.

Similar threads

Replies
2
Views
1K
Replies
1
Views
881
Replies
1
Views
900
Replies
2
Views
2K
Replies
4
Views
1K
Replies
10
Views
3K
Back
Top