PRODUCTS OF BINOMIAL COEFFICIENTS MODULO p 2

نویسندگان

  • Zhi-Wei SUN
  • ZHI-WEI SUN
چکیده

As usual Z, Q, R and C denote the ring of integers, the rational field, the real field and the complex field respectively. We also let Z = {1, 2, 3, · · · } and C∗ = C \ {0}. For a ∈ Z and n ∈ Z, by (a, n) we mean th greatest common divisor of a and n, if n is odd then the Jacobi symbol ( a n ) is defined in terms of Legendre symbols (see, e.g. [IR]). For x ∈ R, [x] and {x} stand for the integral and the fractional parts of x respectively. For a prime p and an integer a prime to p, the Fermat quotient (ap−1 − 1)/p is denoted by qp(a). For an odd prime p and a ∈ Z, we define the Euler quotient

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Congruence for Products of Binomial Coefficients modulo a Composite

For a positive composite integer n, we investigate the residues of ( mn k ) for positive integers m and k. First, we discuss divisibility of such coefficients. Then we study congruence identities relating products of binomial coefficients modulo n. Certainly the Chinese Remainder Theorem can be used in combination with prime power results to evaluate binomial coefficients modulo a composite. Ho...

متن کامل

A CONGRUENCE INVOLVING PRODUCTS OF q-BINOMIAL COEFFICIENTS

In this paper we establish a q-analogue of a congruence of Sun concerning the products of binomial coefficients modulo the square of a prime.

متن کامل

A Fast Algorithm for Computing Binomial Coefficients Modulo Powers of Two

I present a new algorithm for computing binomial coefficients modulo 2N. The proposed method has an O(N3·Multiplication(N)+N4) preprocessing time, after which a binomial coefficient C(P, Q) with 0≤Q≤P≤2N-1 can be computed modulo 2N in O(N2·log(N)·Multiplication(N)) time. Multiplication(N) denotes the time complexity of multiplying two N-bit numbers, which can range from O(N2) to O(N·log(N)·log(...

متن کامل

A ug 2 00 7 Determinants related to binomial coefficients modulo 2 and 4

The main results of this paper are computations of a few determinants related to binomial coefficients. The most interesting example, discovered after browsing through [5], is obtained by considering binomial coefficients modulo 4. We include related results contained in [2] and [3]. The next section recalls mostly well-known facts concerning binomial and q−binomial coefficients and states the ...

متن کامل

Determinants Related to Dirichlet Characters Modulo 2, 4 and 8 of binomial Coefficients and the Algebra of Recurrence Matrices

Using recurrence matrices, defined and described with some details, we study a few determinants related to evaluations of binomial coefficients on Dirichlet characters modulo 2, 4 and 8. 1

متن کامل

Products and Sums of Powers of Binomial Coefficients mod p and Solutions of Certain Quaternary Diophantine Systems

In this paper we prove that certain products and sums of powers of binomial coefficients modulo p = qf + 1, q = a1 + b2, are determined by the parameters x occurring in distinct solutions of the quaternary quadratic partition 16p° = x2 + 2qu2 + 2qv2 + qw2, (x, u, v,w, p) = 1, xw = av2 2buv au2, x ■ 4 (mod q), a > 1. The number of distinct solutions of this partition depends heavily on the class...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004