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 combinatorics
Search options not deleted
user 41369
A puzzle based on combinatorics, which is the study of counting discrete structures. Use with [mathematics]
12
votes
Accepted
Find the smallest positive integer that cannot be made from four 8s, or show it doesn't exist
Bear with me for any poor formatting.
I think I have a way to generate any number using equations of this form:
Equations of this form can be written as:
And then for large a (not even very larg …
- 521