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 digits
Search options answers only
not deleted
user 766
25
votes
Accepted
The parity of the maximal number of consecutive 1s in the binary expansion of an integer
Perhaps surprisingly, the random variable $\ell(n)$ (with $n$ drawn uniformly from $[0,N)$) concentrates too much around $\log_2\log_2 N$ (where $\log_2$ denotes the logarithm to base $2$) to have a l …
- 114k
25
votes
Accepted
Total digit sum in distinct bases grow unboundedlly
As observed in comments, it suffices to show that for fixed $m,k$, there are only finitely many solutions in non-negative integers to the equation
$$ a^{x_1} + \dots + a^{x_m} = b^{y_1} + \dots + b^{y …
- 114k