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 nt.number-theory
Search options not deleted
user 5917
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
10
votes
Undecidable easy arithmetical statement
To talk about undecidability, you have to specify the system.
I consider the simplest system in which you can do real mathematics a system with proof strength $I\Sigma_1$ (feel free to disagree).
In …
- 1,659
2
votes
Can we color Z^+ with n colors such that a, 2a, ..., na all have different colors for all a?
I suggested in a comment, to look for colorings that are the same for each a, except for a fixed permutation.
Suppose the colors are given by function c(x), for x ≥ 1. And a permutation function p(i, …
- 1,659