One trivial zero phenomenon for p-adic analytic function is considered. We then prove that the first derivative of this function is essentially the Kummer class associated with p. 1. Introduction. In this paper we always fix an odd prime p > 2. For n ≥ 1, fix a p n th primitive root of unity ζ p n such that ζ

Modular arithmetic with prime moduli has been crucial in present day cryptography. The primes of Mersenne, Solinas, Crandall and the so called IKE-MODP have been extensively used in efficient implementations. In this paper we study the density of primes with binary signed representation involving a small number of non-zero ±1-digits.

Let Γ(Zm) be the zero divisor graph of the ring Zm. In this paper we explore the p-partite structures of Γ(Zm), as well as determine a complete classification of the chromatic number of Γ(Zm). In particular, we explore how these concepts are related to the prime factorization of m.

Let Zp be the finite field of prime order p and A be a subset of Zp. We prove several sharp results about the following two basic questions: (1) When can one represent zero as a sum of distinct elements of A ? (2) When can one represent every element of Zp as a sum of distinct elements of A ?

Modular arithmetic with prime moduli has been crucial in present day cryptography. The primes of Mersenne, Solinas, Crandall and the so called IKE-MODP primes have been widely used in efficient implementations. In this paper we study the density of primes with binary signed representation involving a small number of non-zero ±1-digits, and its repercussion in the generation of those primes.

The problem of efficient implementation of two-dimensional interpolation in the Guruswami-Sudan list decoding algorithm for Reed-Solomon codes is considered. It is shown that it can be implemented by computing the product of the ideals of interpolation polynomials constructed for subsets of interpolation points. A method for fast multiplication of zero-dimensional co-prime ideals product is pro...

Let Zp be the finite field of prime order p and A be a subset of Zp. We prove several sharp results about the following two basic questions: (1) When can one represent zero as a sum of distinct elements of A ? (2) When can one represent every element of Zp as a sum of distinct elements of A ?

We give a class of examples of a vector bundle on a relative smooth projective curve over SpecZ such that for infinitely many prime reductions the bundle has a Frobenius descent, but the generic restriction in characteristic zero is not semistable. Mathematical Subject Classification (2000): primary: 14H60, secondary: 13A35.

We introduce a two person game played with a pair of nonnegative integers; a move consists of subtracting from the larger integer, a positive integer no greater than the smaller integer. The player who reduces one of the integers to zero wins. The game is curious in several respects: in particular, its Sprague-Grundy values have an interesting connection with prime numbers.

We develop some basic tools to work with representable matroids of bounded tree-width and use them to prove that, for any prime power q and constant k, the characteristic polynomial of any loopless, GF (q)representable matroid with tree-width k has no real zero greater than qk−1.