If all the words with or without meaning made using all the letters of the word "NAGPUR" are arranged as in a dictionary, then the word at $$315^{\text {th }}$$ position in this arrangement is :

Let $$0 \leq r \leq n$$. If $${ }^{n+1} C_{r+1}:{ }^n C_r:{ }^{n-1} C_{r-1}=55: 35: 21$$, then $$2 n+5 r$$ is equal to :

The number of triangles whose vertices are at the vertices of a regular octagon but none of whose sides is a side of the octagon is

Let the set $$S=\{2,4,8,16, \ldots, 512\}$$ be partitioned into 3 sets $$A, B, C$$ with equal number of elements such that $$\mathrm{A} \cup \mathrm{B} \cup \mathrm{C}=\mathrm{S}$$ and $$\mathrm{A} \cap \mathrm{B}=\mathrm{B} \cap \mathrm{C}=\mathrm{A} \cap \mathrm{C}=\phi$$. The maximum number of such possible partitions of $$S$$ is equal to: