Luis H. Gallardo

ABOUT THE PERIOD OF BELL NUMBERS MODULO A PRIME

Let p be a prime number. It is known that the order o(r) of a root r of the irreducible polynomial xp−x−1 over Fp divides g(p) = p p−1 p−1 . Samuel Wagstaff recently conjectured that o(r) = g(p) for any prime p. The main object of the paper is to give some subsets S of {1, . . . , g(p)} that do not contain o(r).

Solving quadratic equations over polynomial rings of characteristic two

We are concerned with solving polynomial equations over rings. More precisely, given a commutative domain

EVERY POLYNOMIAL OVER A FIELD CONTAINING 𝔽 16 IS A STRICT SUM OF FOUR CUBES AND ONE EXPRESSION A 2 + A

A

Sums of cubes of polynomials

with 1 and a polynomial equation

The strict Waring problem for polynomial rings

a_n,t^n+cdots +a_0=0

Perfect polynomials over F4 with less than five prime factors

with coefficients

Every strict sum of cubes in F4[t] is a strict sum of 6 cubes

a_i

New Congruences for Odd Perfect Numbers

in

Sufficient conditions for a conjecture of Ryser about Hadamard Circulant matrices

A

SUMS OF CUBES AND SQUARES OF POLYNOMIALS WITH COEFFICIENTS IN A FINITE FIELD

, our problem is to find its roots in