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 open-problems
Search options not deleted
user 37555
If it turns out that a problem is equivalent to a known open problem, then the open-problem tag is added. After that, the question essentially becomes, "What is known about this problem? What are some possible ways to approach this problem? What are some ways that people have tried to attack it before, and with what results?"
3
votes
Accepted
Open Problems for Undergraduates
Richard Guy compiled a list of open problems in combinatorial game theory, available at http://library.msri.org/books/Book29/files/unsolved.pdf . His book "Unsolved problems in number theory" also con …
6
votes
Not especially famous, long-open problems which anyone can understand
The Kurepa problem: Show that for all primes $p>3$ we have that
$$
0!+1!+2!+\dots+(p-1)!
$$
is not divisible by $p$. Kurepa posed this problem in 1971. For an overview see the article by Ivic and Mija …
22
votes
Accepted
What keeps asymptotic Goldbach's conjecture out of reach of current technology?
As far as I know there are two approaches to Goldbach type problems, the circle method and sieve methods. In the sequel I will restrict myself to the circle method, hoping that someone else writes som …
