Explicit evaluations of the Rogers-Ramanujan continued fraction.
Previous Page 4
Displaying 61 – 69 of 69
Explicit reciprocity laws on relative Lubin-Tate groups
Yutaka Sueyoshi (1990)
Acta Arithmetica
Exponents of primes in generalized binomial coefficients.
Abraham P. Hillman, V.E. Jr. Hoggatt (1973)
Journal für die reine und angewandte Mathematik
Expressing rationals as a sum of a small number of unit fractions
William A. Webb (1980)
Časopis pro pěstování matematiky
Extended Euclidean Algorithm and CRT Algorithm
Hiroyuki Okazaki, Yosiki Aoki, Yasunari Shidama (2012)
Formalized Mathematics
In this article we formalize some number theoretical algorithms, Euclidean Algorithm and Extended Euclidean Algorithm [9]. Besides the a gcd b, Extended Euclidean Algorithm can calculate a pair of two integers (x, y) that holds ax + by = a gcd b. In addition, we formalize an algorithm that can compute a solution of the Chinese remainder theorem by using Extended Euclidean Algorithm. Our aim is to support the implementation of number theoretic tools. Our formalization of those algorithms is based...
Extended GCD and Hermite normal form algorithms via lattice basis reduction.
Havas, George, Majewski, Bohdan S., Matthews, Keith R. (1998)
Experimental Mathematics
Extension aux nombres premiers complexes des théorèmes de M. Tchebicheff
H. Poincaré (1892)
Journal de Mathématiques Pures et Appliquées
Extensions of Bauer's identical congruences
Štefan Schwarz (1983)
Mathematica Slovaca
Extensions of the Gauss-Wilson theorem.
Cosgrave, John B., Dilcher, Karl (2008)
Integers
Currently displaying 61 – 69 of 69
Previous Page 4