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 circle-method
Search options not deleted
user 38104
0
votes
Asymptotic formula for the number of ways to write a number as the sum of $k$ triangular num...
Use circle method detect the condition $N=\sum_{i=1}^k \frac{m_i(m_i+1)}{2}$ to derive
$r(N)=\int_0^1 f^k(\alpha) e(-N\alpha)$, where $f(\alpha)=\sum_{n\leq N} e(\alpha \frac{m_i(m_i+1)}{2} )=\int_ …
- 177