Algorithme de Jacobi-Perron dans un corps de séries formelles
Algorithme de multiplicativité des sommes de carrés
Algorithme isobarique
Algorithmes d'Euclide dans certains corps biquadratiques
Algorithmes numériques relatifs aux corps cubiques cycliques
Algorithmes pour vérifier la conjecture de Syracuse
Algorithms for Bernoulli and related polynomials.
Algorithms for Bernoulli numbers and Euler numbers.
Algorithms for finding good examples for the and Szpiro conjectures.
Algorithms for function fields.
Algorithms for quadratic forms over real function fields
This paper presents algorithms for quadratic forms over a formally real algebraic function field K of one variable over a fixed real closed field k. The algorithms introduced in the paper solve the following problems: test whether an element is a square, respectively a local square, compute Witt index of a quadratic form and test if a form is isotropic/hyperbolic. Finally, we remark on a method for testing whether two function fields are Witt equivalent.
Algorithmus für Bell'sche Polynome
Aliquot sequence 3630 ends after reach 100 digits.
All Congruent Numbers Less than 2000.
All elite primes up to 250 billion.
All Generalized Morse-Sequences are Loosely Bernoulli.
All Liouville Numbers are Transcendental
In this Mizar article, we complete the formalization of one of the items from Abad and Abad’s challenge list of “Top 100 Theorems” about Liouville numbers and the existence of transcendental numbers. It is item #18 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/. Liouville numbers were introduced by Joseph Liouville in 1844 [15] as an example of an object which can be approximated “quite closely” by a sequence of rational numbers. A real...
All Two-Gnerator Fuchsian Group.
Alle großen ganzen Zahlen lassen sich als Summe von höchstens 71 Primzahlen darstellen
Allgemeine Theorie der kettenbruchähnlichen Algorithmen, in welchen jede Zahl aus drei vorhergehenden gebildet wird.