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 soft-question
Search options not deleted
user 17761
Questions that are about research in mathematics, or about the job of a research mathematician, without being mathematical problems or statements in the strictest sense. Do not use this tag for easy or supposedly easy mathematical questions.
9
votes
How has modern algebraic geometry affected other areas of math?
The size of Fourier coefficients of modular forms can only be studied (so far) via the use of very sophisticated tools from Algebraic Geometry. Of course, one could argue that modular forms are part o …
- 3,065
0
votes
Elementary results with p-adic numbers
You could mention Fermat's last theorem: Kummer's proof (in the regular case) uses properties of Bernoulli numbers that are close to the existence of the p-adic zeta function, and Wiles's proof uses p …
- 21
9
votes
Examples of seemingly elementary problems that are hard to solve?
Take two commutative rings $A$ and $B$ such that the polynomial rings $A[X]$ and $B[X]$ are isomorphic. Does this imply that $A$ and $B$ are isomorphic? (I think this is still open.)
- 21
2
votes
Generalizing a problem to make it easier
Here is a riddle which proves to be extremely hard: Imagine a finite assembly in which some people happen to be friends (friendship is a symmetric relation but not transitive and you are
not your own …
- 21