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 510137
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
15
votes
"Make all numbers equal" game
The problem is soluble for real numbers, and indeed for any tuple $(x_1, \dots, x_n)$ with $n$ even and $x_i$ real (or in any abelian group) for all $i$. (For impossibility for odd-length tuples see t …
- 193
0
votes
0
answers
172
views
Elementary method for finding integer solutions for certain types of elliptic curve
There are some problems in high school Olympiad that ask to find integer solutions of the form $Q(x^2) = dy^2 (*)$ where $Q$ is a quadratic polynomial and $d$ is an absolute constant and quite often, …
- 193