Find Integer $k$ to Satisfy Sum of Inverse Progression > 2000

In summary, an inverse progression is a sequence of numbers where each term is the reciprocal of the corresponding term in a normal arithmetic progression. The sum of an inverse progression being greater than 2000 means that when all the terms are added together, the result is a number greater than 2000. Finding an integer k to satisfy this condition is important as it allows us to determine the minimum number of terms needed in the inverse progression. This can be done by trial and error or using mathematical equations. There can be multiple values of k that satisfy the condition as there can be many different inverse progressions with varying numbers of terms.
  • #1
anemone
Gold Member
MHB
POTW Director
3,883
115
Find an integer $k$ for which $\dfrac{1}{k}+\dfrac{1}{k+1}+\dfrac{1}{k+2}+\cdots+\dfrac{1}{k^2}>2000$.
 
Mathematics news on Phys.org
  • #2
I try:
$\displaystyle\dfrac{1}{k}+\dfrac{1}{k+1}+\dfrac{1}{k+2}+\cdots+\dfrac{1}{k^2}=\sum_{1}^{k^2}\dfrac{1}{n}-\sum_{1}^{k-1}\dfrac{1}{n}$
The partial sums of the harmonic series have logarithmic growth i.e. $\displaystyle\sum_{1}^{k}\dfrac{1}{n}\sim \ln k$
therefore
$\displaystyle\sum_{1}^{k^2}\dfrac{1}{n}-\sum_{1}^{k}\dfrac{1}{n}\sim \ln k^2-\ln (k-1)=\ln\dfrac{k^2}{k-1}$.
$\ln\dfrac{k^2}{k-1}>2000\ \Rightarrow\ \dfrac{k^2}{k-1}>e^{2000}\ \Rightarrow k>\dfrac{e^{2000}+\sqrt{e^{4000}-4e^{2000}}}{2}$.
$\dfrac{e^{2000}+\sqrt{e^{4000}-4e^{2000}}}{2}\sim 3.88\cdot 10^{868}$.
$4\cdot 10^{868}$ should be enough...
 
  • #3
laura123 said:
I try:
$\displaystyle\dfrac{1}{k}+\dfrac{1}{k+1}+\dfrac{1}{k+2}+\cdots+\dfrac{1}{k^2}=\sum_{1}^{k^2}\dfrac{1}{n}-\sum_{1}^{k-1}\dfrac{1}{n}$
The partial sums of the harmonic series have logarithmic growth i.e. $\displaystyle\sum_{1}^{k}\dfrac{1}{n}\sim \ln k$
therefore
$\displaystyle\sum_{1}^{k^2}\dfrac{1}{n}-\sum_{1}^{k}\dfrac{1}{n}\sim \ln k^2-\ln (k-1)=\ln\dfrac{k^2}{k-1}$.
$\ln\dfrac{k^2}{k-1}>2000\ \Rightarrow\ \dfrac{k^2}{k-1}>e^{2000}\ \Rightarrow k>\dfrac{e^{2000}+\sqrt{e^{4000}-4e^{2000}}}{2}$.
$\dfrac{e^{2000}+\sqrt{e^{4000}-4e^{2000}}}{2}\sim 3.88\cdot 10^{868}$.
$4\cdot 10^{868}$ should be enough...

Hi Laura123,

Sorry for the late reply. I can explain...Actually I hoped there would be more submissions for this challenge, that was why I waited a bit longer...:eek:

You have done a great job there and your answer is correct, well done! And thanks for participating in this particular challenge.

I want to share with you and other members the solution that I have found online:

Solution of other:

Any integer $k>e^{2000}$ suffices.

For $\displaystyle \sum_{n=k}^{k^2} \dfrac{1}{n}=\int_{k}^{k^2+1} \dfrac{1}{\left\lfloor{x}\right\rfloor}\,dx>\int_{k}^{k^2} \dfrac{1}{x}\,dx=\ln k$

and $\ln k>2000$ when $k>e^{2000}$.
 

FAQ: Find Integer $k$ to Satisfy Sum of Inverse Progression > 2000

What is an inverse progression?

An inverse progression is a sequence of numbers where each term is the reciprocal of the corresponding term in a normal arithmetic progression. For example, the inverse progression of 1, 2, 3, 4 would be 1/1, 1/2, 1/3, 1/4.

What does it mean for the sum of an inverse progression to be greater than 2000?

This means that when all the terms in the inverse progression are added together, the result is a number greater than 2000.

Why is finding an integer k to satisfy this condition important?

Finding an integer k allows us to determine the minimum number of terms needed in the inverse progression to satisfy the condition. This can be useful in solving mathematical problems or in real-life applications such as finance, where inverse progressions are commonly used in calculating interest rates.

How can I find the integer k to satisfy the sum of inverse progression > 2000?

This can be done by trial and error, starting with k=1 and adding more terms to the inverse progression until the sum exceeds 2000. Alternatively, it can also be solved using mathematical equations and formulas.

Can there be more than one integer k that satisfies the condition?

Yes, there can be multiple values of k that satisfy the condition. This is because there can be many different inverse progressions with varying numbers of terms that can result in a sum greater than 2000.

Similar threads

Replies
1
Views
882
Replies
1
Views
972
Replies
2
Views
875
Replies
1
Views
884
Replies
4
Views
989
Replies
1
Views
1K
Replies
3
Views
1K
Replies
5
Views
2K
Back
Top