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 402326
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
0
votes
Accepted
Computing Lucas sequence for large n
Following Emil remark, I used other relations to obtain a $O(\log n)$ algorithm:
$\begin{cases}U_{2n}=U_nV_n\\
V_{2n}=V_n^2-2Q^n\\
U_{2n+1} = U_{n+1}V_n - Q^n\\
V_{2n+1} = V_{n+1}V_n -PQ^n\end{cases}$ …
- 11
1
vote
1
answer
212
views
Computing Lucas sequence for large n
I've been trying to write a test function for Fibonacci pseudo-primes with large $n$. Fibonacci pseudoprimes are composite numbers such that $V_n(P,Q) \equiv P \mod n$ for $P>0$ and $Q =\pm 1$, with $ …
- 11