# Changeset 7456:f60ec7365b2b

Ignore:
Timestamp:
12/01/07 10:48:42 (6 years ago)
Branch:
default
Parents:
7454:0cb746e1a4bd (diff), 7455:3eda63e6eb1a (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.
Message:

merge

Files:
2 edited

### Legend:

Unmodified
 r7455 r""" Returns True if $x$ is prime, and False otherwise.  The result is proven correct -- {\em this is NOT a pseudo-primality test!}. is proven correct -- \emph{this is NOT a pseudo-primality test!}. INPUT: r""" Returns True if $x$ is a pseudo-prime, and False otherwise.  The result is \em{NOT} proven correct -- {\em this is a pseudo-primality test!}. is \emph{NOT} proven correct -- \emph{this is a pseudo-primality test!}. INPUT: r""" Returns True if $x$ is a prime power, and False otherwise. The result is proven correct -- {\em this is NOT a The result is proven correct -- \emph{this is NOT a pseudo-primality test!}. The qsieve and ecm commands give access to highly optimized implementations of algorithms for doing certain integer factorization problems.  These implementation are not used by factorization problems.  These implementations are not used by the generic factor command, which currently just calls PARI (note that PARI also implements sieve and ecm algorithms, but [1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] sage: continued_fraction_list(sqrt(4/19)) [0, 2, 5, 1, 1, 2, 1, 16, 1, 2, 1, 1, 5, 4, 5, 1, 1, 2, 1, 18] [0, 2, 5, 1, 1, 2, 1, 16, 1, 2, 1, 1, 5, 4, 5, 1, 1, 2, 1, 15, 2] sage: continued_fraction_list(RR(pi), partial_convergents=True) ([3, 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 3],