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 16054
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
2
votes
1
answer
475
views
Small geometric progression modulo N
An problem related to integer factorization using the General Number Field Sieve is the following:
Let $N$ be a composite. Must there exist a 5-term geometric progression $\lbrace a_0,a_1,a_2,a_ …
- 39.9k
7
votes
Fastest way to factor integers < 2^60
Inria has published a paper factoring 50-200 bits integers.
The four methods of choice are: SQUFOF, ECM, SIQS and CFRAC.
Within the paper a short pseudocode is given for each method, so you may be …
- 360
1
vote
Accepted
primes dividing binomial coefficients
Hi! I have a proposed answer for 2).
You can construct an infinite series of counter examples. Erdos proved that there are primes between $n$ and $2n$. Now consider $2n=2^k$ for some $k>2$.
We c …
- 360