-
@JuliaRegistrator register
v0.6.0
Release notes:
added `lucas` for Lucas Numbers and extended `fibonnacci` to all integers.
-
Made by hand, rather than using wtfjs, but I'm sure it's easy to redo:
```
function lucas(n) { for(_=++[+[]][+[]],__=++[_][+[]]
-
Suggestion: Add more lists, such as triangular numbers or lucas numbers. Also, maybe make another list command where it will get the first `n` numbers in the sequence, not numbers in the sequence up t…
-
### Author(s) of proposal
Lucas V. Lima, Thaís E. Almeida & Alexandre Salino
### Name of taxon
Sticheropsis
### Rank of taxon
Genus
### Approximate number of species affected
2
…
-
There are a few tricks that may speed up the Lucas test:
1. Crandall & Pomerance[^Crandall2005], after Algorithm 3.6.7 (Lucas chain), provide some ways to reduce the general `(P, Q)` Lucas sequence…
-
If `n` is a Carmichael number or a Lucas-Carmichael number, it can be factorized very fast, using the following methods.
These methods may also work for Fermat or Lucas pseudoprimes.
**Miller-Ra…
-
On the final upload, we time out. We're probably (newly) hitting this because we've added fields over time as well as added more data each day, since we upload all historical data which keeps growing.…
-
Implementation of the following in Python:
- [x] Find volumes of various shapes (cube, cuboid, cone, right circular cone, prism, pyramid, sphere, circular cylinder)
- [x] Zellers Congruence Alg…
-
Lucas' theorem is a result of binomial coefficients modulo a prime p.
We will be given three numbers n, r, and p and we need to compute the value of nCr mod p.
-
This is a metaticket listing **existing** functions for which symbolic implementations are urgently needed because
* they exist in Sympy, Maxima, or Fricas symbolically, and might be returned as res…