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 algorithms
Search options not deleted
user 4213
Informally, an algorithm is a set of explicit instructions used to solve a problem (e.g. Euclid's algorithm for computing the greatest common divisor of two integers). For more specific questions on algorithms, this tag may be used in conjunction with the approximation-algorithms, algorithmic-randomness and algorithmic-topology tags.
6
votes
Suggestions for sonifying math
There is Per Norgard's "infinity series"
which he used in his Symphony no. 2.
4
votes
Reference request: given a divisor d of N, how quickly can I obtain the largest factor of N ...
Another approach would be to take the gcd of $N$ and a large power $p^k$
of $p$. This would give $n_1$. In a worst case scenario, $k$ could be $\lg N$,
but usually you wouldn't need anything this big. …
- 20.8k
5
votes
Ideals in the ring of single-variable Laurent polynomials with integer coefficients
Well, $\mathbb{Z}[t,t^{-1}]$ is the localization of the
polynomial ring $R=\mathbb{Z}[t]$ with respect to the multiplicative
set $S$ consisting of the powers of $t$. The ideals of
$S^{-1}R=\mathbb{Z}[ …
- 20.8k
10
votes
Algorithms for finding rational points on an elliptic curve?
There is a whole industry devoted to this. The basic method is by
descent, which is a formalized version of the infinite descent proofs
of Fermat and Euler. It helps if there are rational 2-torsion po …
- 20.8k