FoCM 2014 conference

Workshop B7 - Symbolic Analysis

December 16, 18:00 ~ 18:25 - Room C21

## Combinatorics, Number Theory, and Symbolic Analysis

### RISC, Johannes Kepler University, Austria   -   Peter.Paule@risc.uni-linz.ac.at

Partition numbers $p(n)$ give the number of additive decompositions of nonnegative integers. For example, $4=3+1=2+2=2+1+1=1+1+1+1$, so $p(4)=5$. Ramanujan observed that all numbers $p(5n+4)$, $n\geq 0$, are divisible by 5. Recently, in the context of modular forms, Silviu Radu (RISC) has set up an algorithmic machinery to prove such congruences automatically. The talk is about new developments in this area and discusses various connections between combinatorics, number theory, and symbolic analysis.