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 counterexamples
Search options not deleted
user 81488
A counterexample is an example that disproves a mathematical conjecture or a purported theorem. For example, the Peterson graph is a counterexample to many seemingly plausible conjectures in Graph Theory.
4
votes
Accepted
Dependent Bernoulli sequence for which the strong law fails to hold
Let $(S_n, n\geq 0)$ be the one-dimensional simple random walk started at the origin. Set $X_n=\mathbf{1}\{S_n\geq 0\}$. Then $n^{-1}(X_1+\cdots+ X_n)$ is the proportion of time that the SRW is non-ne …
- 1,897