you have 2 identical mathematics
books, 2 identical physics books, 2
identical chemistry books, 2 identical
biology books and 2 geography books.
in how many ways can you compile
these books such that same books
are not mutually adjacent?
For a positive integer k, we write
(1+x)(1+2x)(1+3x)...(1+kx)=a_0 +a_1 x+a_2 x^2 +...a_k x^k
Let N=a_0 +a_1 +a_2 +...a_k ,
if N is divisible by 2019, find the
smallest possible value of k.