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 12978
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
3
votes
Rationale behind an requirement on Turing machines
It is important to realize that a Turing machine---and even more so, a specific implementation of a Turing machine---is just one of many models of computation. The earliest models of computation, for …
- 6,287
0
votes
Computing the measure of the projection on the torus of a semialgebraic set
Update: I didn't see the "congruent mod 1" part. Sorry, my answer below probably won't be of much help. It was just for a set in the cube $[0,1]^n$ cut out by a system of inequalities. But still it …
- 6,287
3
votes
Accepted
What is the relation between KC and height of rational number?
After thinking about it for a bit, the relationship is as follows for a rational $q$,
$$K(\text{height}\,q) \leq^+ K(q) \leq^+ 2\,\text{height}\,q.$$
This isn't really a surprising or useful relations …
- 6,287
15
votes
1
answer
1k
views
Is there a known primitive recursive upper bound on the nth "Zhang prime"
(This question is pure curiosity. Feel free to close it if you feel it is not appropriate for mathoverflow.)
In 2013 Zhang showed that there are infinitely many pairs of primes which are less that 7 …
- 6,287