DOIAbstract
AbstractFor p prime and . A parallel, but rather different congruence holds modulo p3
AbstractFor p prime and . A parallel, but rather different congruence holds modulo p3
AbstractIn 1878 Lucas established a method of computing binomial coefficients modulo a prime. We est...
Abstract. Much is known about binomial coefficients where primes are con-cerned, but considerably le...
Text. We prove congruences, modulo a power of a prime p, for certain finite sums involving central b...
AbstractLet p > 3 be a prime, and n, k, a, b, r, and s be non-negative integers, n, k, r, s > 0, 0 ≤...
AbstractLet p > 3 be a prime, and n, k, a, b, r, and s be non-negative integers, n, k, r, s > 0, 0 ≤...
AbstractFor p prime and . A parallel, but rather different congruence holds modulo p3
We establish a q-analogue of the congruence (papb)≡(ab) (modp2) where p is a prime and a and b are...
We establish a q-analogue of the congruence (papb)≡(ab) (modp2) where p is a prime and a and b are...
Recently the first author proved a congruence proposed in 2006 by Adamchuk: Sigma([2p/3])(k=1) (2k k...
Recently the first author proved a congruence proposed in 2006 by Adamchuk: Sigma([2p/3])(k=1) (2k k...
Recently the first author proved a congruence proposed in 2006 by Adamchuk: Sigma([2p/3])(k=1) (2k k...
Recently the first author proved a congruence proposed in 2006 by Adamchuk: Sigma([2p/3])(k=1) (2k k...
AbstractWe prove that Apéry numbers satisfy an analog mod p, p2 and p3 of the congruence of Lucas fo...
AbstractWe present several congruences for sums of the type ∑k=1p−1mkk−r(2kk)−1, modulo a power of a...
Abstract. In this paper we prove three conjectures on congruences in-volving central binomial coeffi...
AbstractIn 1878 Lucas established a method of computing binomial coefficients modulo a prime. We est...
Abstract. Much is known about binomial coefficients where primes are con-cerned, but considerably le...
Text. We prove congruences, modulo a power of a prime p, for certain finite sums involving central b...
AbstractLet p > 3 be a prime, and n, k, a, b, r, and s be non-negative integers, n, k, r, s > 0, 0 ≤...
AbstractLet p > 3 be a prime, and n, k, a, b, r, and s be non-negative integers, n, k, r, s > 0, 0 ≤...
AbstractFor p prime and . A parallel, but rather different congruence holds modulo p3
We establish a q-analogue of the congruence (papb)≡(ab) (modp2) where p is a prime and a and b are...
We establish a q-analogue of the congruence (papb)≡(ab) (modp2) where p is a prime and a and b are...
Recently the first author proved a congruence proposed in 2006 by Adamchuk: Sigma([2p/3])(k=1) (2k k...
Recently the first author proved a congruence proposed in 2006 by Adamchuk: Sigma([2p/3])(k=1) (2k k...
Recently the first author proved a congruence proposed in 2006 by Adamchuk: Sigma([2p/3])(k=1) (2k k...
Recently the first author proved a congruence proposed in 2006 by Adamchuk: Sigma([2p/3])(k=1) (2k k...
AbstractWe prove that Apéry numbers satisfy an analog mod p, p2 and p3 of the congruence of Lucas fo...
AbstractWe present several congruences for sums of the type ∑k=1p−1mkk−r(2kk)−1, modulo a power of a...
Abstract. In this paper we prove three conjectures on congruences in-volving central binomial coeffi...
AbstractIn 1878 Lucas established a method of computing binomial coefficients modulo a prime. We est...
Abstract. Much is known about binomial coefficients where primes are con-cerned, but considerably le...
Text. We prove congruences, modulo a power of a prime p, for certain finite sums involving central b...
Add to ORKG