Let R₁ = {(a, b) $$\in$$ N $$\times$$ N : |a $$-$$ b| $$\le$$ 13} and

R₂ = {(a, b) $$\in$$ N $$\times$$ N : |a $$-$$ b| $$\ne$$ 13}. Then on N :

Let f(x) be a quadratic polynomial such that f($$-$$2) + f(3) = 0. If one of the roots of f(x) = 0 is $$-$$1, then the sum of the roots of f(x) = 0 is equal to :

The number of ways to distribute 30 identical candies among four children C₁, C₂, C₃ and C₄ so that C₂ receives at least 4 and at most 7 candies, C₃ receives at least 2 and at most 6 candies, is equal to :

The term independent of x in the expansion of

$$(1 - {x^2} + 3{x^3}){\left( {{5 \over 2}{x^3} - {1 \over {5{x^2}}}} \right)^{11}},\,x \ne 0$$ is :