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 exponential-sums
Search options not deleted
user 108321
The method of exponential sums is one of a few general methods enabling us to solve a wide range of miscellaneous problems from the theory of numbers and its applications. The strongest results have been obtained with the aid of this method. Therefore knowledge of the fundamentals of theory of exponential sums is necessary for studying modern number theory.
-4
votes
1
answer
360
views
How many integers between $\left[2^{2^k}, 2^{2^{k+1}}\right]$? [closed]
Suppose $k$ and $n$ are natural numbers such that $2^{2^k} \lt n \lt 2^{2^{k+1}}$. I am curious how many integers are there in the interval $\left[2^{2^k}, 2^{2^{k+1}}\right]$ in terms of $n$.
I need …
- 103