Algorithmes pour vérifier la conjecture de Syracuse
Algorithms for Bernoulli and related polynomials.
Algorithms for Bernoulli numbers and Euler numbers.
Algorithmus für Bell'sche Polynome
All Congruent Numbers Less than 2000.
Almost powers in the Lucas sequence
The famous problem of determining all perfect powers in the Fibonacci sequence and in the Lucas sequence has recently been resolved [10]. The proofs of those results combine modular techniques from Wiles’ proof of Fermat’s Last Theorem with classical techniques from Baker’s theory and Diophantine approximation. In this paper, we solve the Diophantine equations , with and , for all primes and indeed for all but primes . Here the strategy of [10] is not sufficient due to the sizes of...
Almost product evaluation of Hankel determinants.
An Addition Theorem for the Elementary Abelian Group of Type (p, p).
An Addition Theorem in a Finite Abelian Group.
An addition theorem on the cyclic group .
An algorithmic proof theory for hypergeometric (ordinary and "q") multisum/integral indentities.
An Alternative Form of the Functional Equation for Riemann’s Zeta Function, II
This paper treats about one of the most remarkable achievements by Riemann, that is the symmetric form of the functional equation for . We present here, after showing the first proof of Riemann, a new, simple and direct proof of the symmetric form of the functional equation for both the Eulerian Zeta function and the alternating Zeta function, connected with odd numbers. A proof that Euler himself could have arranged with a little step at the end of his paper “Remarques sur un beau rapport entre...
An analogue of the Erdős-Ginzburg-Ziv theorem for quadratic symmetric polynomials.
An analogue of the Thue-Morse sequence.
An application of Catalan numbers on Cayley tree of order 2: Single polygon counting.
An application of Tao's analytic method to restricted sumsets
An application of van der Waerden's theorem in additive number theory.
An asymptotic expansion for the Bernoulli numbers of the second kind.
An asymptotic expansion for the Catalan-Larcombe-French sequence.
An awful problem about integers in base four