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 73680
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
1
vote
Efficient Dirichlet approximation (continued fractions?) over a number field
Attila Pethő, Michael E. Pohst, Csanád Bertók, On multidimensional Diophantine approximation of algebraic numbers, Journal of Number Theory, Volume 171, February 2017, Pages 422-448, ISSN 0022-314X, h …
- 131
0
votes
Given an integer $N$, find solutions to $X^3 + Y^3 + Z^3 - 3XYZ \equiv 1 \pmod{N}$
Here is a method to find your triples that is not rapid, perhaps trivial, and highly conjectural. Hopefully it is still of some interest. First, find positive integers $x$, $y$, and $z$ that solve $ …
- 131
2
votes
"Most Similar Vector Problem" on an Integer Lattice?
Comment: You seem to be looking for best simultaneous diophantine approximations of a certain kind. In the original LLL article, "Factoring Polynomials with Rational Coefficients", the authors (Lenstr …
- 131