The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Previous Page 2

Displaying 21 – 36 of 36

Showing per page

On sums of binomial coefficients modulo p²

Zhi-Wei Sun (2012)

Colloquium Mathematicae

Let p be an odd prime and let a be a positive integer. In this paper we investigate the sum k = 0 p a - 1 ( h p a - 1 k ) ( 2 k k ) / m k ( m o d p ² ) , where h and m are p-adic integers with m ≢ 0 (mod p). For example, we show that if h ≢ 0 (mod p) and p a > 3 , then k = 0 p a - 1 ( h p a - 1 k ) ( 2 k k ) ( - h / 2 ) k ( ( 1 - 2 h ) / ( p a ) ) ( 1 + h ( ( 4 - 2 / h ) p - 1 - 1 ) ) ( m o d p ² ) , where (·/·) denotes the Jacobi symbol. Here is another remarkable congruence: If p a > 3 then k = 0 p a - 1 ( p a - 1 k ) ( 2 k k ) ( - 1 ) k 3 p - 1 ( p a / 3 ) ( m o d p ² ) .

On useful schema in survival analysis after heart attack

Czesław Stępniak (2014)

Discussiones Mathematicae Probability and Statistics

Recent model of lifetime after a heart attack involves some integer coefficients. Our goal is to get these coefficients in simple way and transparent form. To this aim we construct a schema according to a rule which combines the ideas used in the Pascal triangle and the generalized Fibonacci and Lucas numbers

Currently displaying 21 – 36 of 36

Previous Page 2