Approximate sum with Euler's contant
显示 更早的评论
How do I approximate the lowest number of n with Euler's constant (0.577) so that the sum is greater than 14,3?
How do I after that calculate the exact value of n?
3 个评论
Torsten
2022-12-23
Hint:
For n large, your sum is approximately eulergamma + log(n). Can you solve
eulergamma + log(n) = 14.3
for n ?
Nathalie
2022-12-23
John D'Errico
2022-12-23
Since you know ROUGHLY how far to go from the comment from @Torsten. Why not just form the sum using a while loop? You know that it will not go too far. Stop the while loop when it exceeds that amount. In fact, it will take only a moderately short loop. Or, you could use cumsum.
But you need to make an effort.
回答（1 个）
You may also try a symbolic math TB's function syms and solve(), e.g.:
syms x
Solution = solve(pi-sin(x)==1, x)
Solution_values = double(Solution) % Get the solution values in double format
类别
在 帮助中心 和 File Exchange 中查找有关 Symbolic Math Toolbox 的更多信息
2022-12-23
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
