Sciweavers

157 search results - page 23 / 32
» moc 2000
Sort
View
MOC
1998
147views more  MOC 1998»
13 years 9 months ago
On the Diophantine equation |axn - byn | = 1
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptio...
Michael A. Bennett, Benjamin M. M. de Weger
MOC
1998
80views more  MOC 1998»
13 years 9 months ago
Fast evaluation of multiple zeta sums
We show that the multiple zeta sum: ζ(s1, s2, ..., sd) = n1>n2>...>nd 1 ns1 1 ns2 2 ...n sd d , for positive integers si with s1 > 1, can always be written as a finit...
Richard E. Crandall
MOC
1998
85views more  MOC 1998»
13 years 9 months ago
Remarks on the Schoof-Elkies-Atkin algorithm
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
L. Dewaghe
MOC
1998
136views more  MOC 1998»
13 years 9 months ago
Total variation diminishing Runge-Kutta schemes
In this paper we further explore a class of high order TVD (total variation diminishing) Runge-Kutta time discretization initialized in a paper by Shu and Osher, suitable for solvi...
Sigal Gottlieb, Chi-Wang Shu
MOC
1998
66views more  MOC 1998»
13 years 9 months ago
The d2-transformation for infinite double series and the D2-transformation for infinite double integrals
New transformations for accelerating the convergence of infinite double series and infinite double integrals are presented. These transformations are generalizations of the univa...
Chen Greif, David Levin