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 |
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
29
votes
3
answers
4k
views
Galois theory timeline
A recent question on the history of Galois theory wasn't the most satisfactory. But the historical issues do seem quite attractive. They relate to innovation, and to exposition. There is a perspective …
18
votes
Accepted
The multiplicative order of 2 modulo primes
The answer is "yes" - the order mod p of 2 is almost always as large as the square root of p (actually you get epsilon less than this in the exponent). If you take r multiplicatively independent numbe …
16
votes
To what extent is it true that "number theory = mathematics"?
I just don't think it's true, despite my own tastes in topics. Such formulations are substantially a matter of fashion.
There is one basic axis, running from very detailed information at one end (wh …
15
votes
Accepted
4900, a particularly square number
This is a classical Diophantine equation (Mordell, Diophantine Equations, p. 258). Apart from n = 0, 1, -1, there is only the solution n = 24. Proofs by G. N. Watson (1919), W. Ljunggren (1952).
Ther …
14
votes
Accepted
When is a ring the ring of adeles of some global field
Iwasawa gave a characterisation, assuming you are given a subfield F, discrete and such that the quotient is compact. The other conditions are R a semisimple locally compact commutative topological ri …
13
votes
Theorems which say "such and such method cannot possibly prove FLT"
The motivation "because I'd like to know [...] if it is impossible to prove FLT using elementary methods" seems to require comment. It is much more likely (in my view) that it is true that FLT can be …
12
votes
Approaches to Riemann hypothesis using methods outside number theory
I think, tautologously, any method proving the Riemann Hypothesis (or even seriously improving our knowledge on the zeroes) becomes "number theory" immediately. That said, I know what the question mea …
11
votes
Accepted
Solve in positive integers $n!=m^2$
Bertrand's postulate (http://en.wikipedia.org/wiki/Bertrand%27s_postulate).
10
votes
Why are modular forms interesting?
Bryan Birch's view is that they form a bottomless area for research problems. All answers to the question fall into two types: showing examples of why this is true, and asking why it should be true. G …
9
votes
What is the geometry of an undecidable diophantine equation?
You have a typical recursively enumerable set S of integers, and a set X of lattice points cut out by a multivariate polynomial. We are talking about S being the projection (onto one axis) of X. Given …
9
votes
Advances and difficulties in effective version of Thue-Roth-Siegel Theorem
One way of looking at the issue is this: it is quite easy to transform the question of good rational approximations to algebraic numbers into a question about integral points on certain affine curves …
9
votes
Accepted
Can Gauss sums derandomize any heuristic arguments?
The thing is that it is well known that for the quadratic Gauss sums, expressed as an exponential sum rather than with Legendre symbols, the path is very much not a random walk when you plot it in the …
8
votes
Explaining the number field-function field analogy
I think your statement could usefully be sharpened in a couple of ways.
Firstly, the state-of-the-art is that true statements for function fields are expected to have analogues for number fields. Th …
8
votes
2
answers
572
views
Proof theory and primitive roots
I have had this question on my mind for two decades. We know, after Heath-Brown, that one out (say) of 3, 5, 7 is a primitive root mod p for infinitely many primes p. We just don't know which one. (We …
7
votes
How should an analytic number theorist look at Bessel functions?
From the point of view of analytic number theory, the point usually would be asymptotic behaviour. This is typically well understood, and is in the massive book of Watson. Apart from that, yes, numero …