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 522716
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
3
votes
1
answer
81
views
On composite divisors of certain terms in the extended Lucas sequences
One can easily show that if $p$ is a prime that does not divide $a$, then $a^{p(p-1)}\equiv 1 \pmod{p^2}$.
However, my question is: If instead of $p$ being a prime, it were a pseudoprime to the base $ …
- 99
2
votes
1
answer
206
views
On pseudoprimes to the base $a$ (Fermat pseudoprimes)
In 1980, C. Pomerance, J. Selfridge, and S. S. Wagstaff defined a pseudoprime to the base a to be any composite odd $n$ such that $n \mid a^{n-1} - 1$.
More recently, in 2013, S. S. Wagstaff referred …
- 99
2
votes
1
answer
218
views
On the computational complexity of Pepin's test
Let $F_{n} = 2^{2^{n}} + 1$, where $n > 0$.
Pepin's Test asserts that $F_{n}$ is prime if and only if $F_{n} \mid 3^{\frac{F_{n} - 1}{2}} + 1$.
QUESTION: What is the big-$\mathcal O$ complexity of thi …
- 99