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 computational-number-theory
Search options not deleted
user 3659
Computational Number Theory is for explicit calculations or algorithms involving anything of interest to number theorists.
6
votes
Differences of squares
Here is a simple way to find one representation of $N$ as a difference of two squares.
No integer $N\equiv 2 \text{ mod } 4$ is a difference of squares.
If $N$ is odd, then
$$ N= (\frac{N+1}{2})^2 - …
- 5,037
29
votes
Accepted
Sum of $\sum_{k=1}^nd(k^2)$
In the case you are interested in there is a simple generating (Dirichlet) series:
$$ \sum_{n=1}^\infty \frac{d(n^2)}{n^s} = \frac{\zeta^3(s)}{\zeta(2s)}.$$
From this you can either use a convolution …
- 5,037