Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with approximation-theory
Search options not deleted
user 105480
Approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby.
0
votes
Asymptotics for the number of digits of the ratio of binomial coefficients
This is only a partial solution.
Write $\log(a_{n}^n)=n\log(a_{n})+\sum_{i=1}^{n-1}\log(1+\frac{i}{a_{n}})$.
For the first term, we have $\log(a_{n})=\log(a)+\log(n)+o(1)$.
For the second term, we h …
- 56