Let $S=\{1,2,3, \ldots \ldots, n\}$ and $A=\{(a, b) \mid 1 \leq$ $a, b \leq n\}=S \times S$. A subset $B$ of $A$ is said to be a good subset if $(x, x) \in B$ for every $x \in S$. Then, the number of good subsets of $A$ is

Let $S$ be the set of all ordered pairs $(x, y)$ of positive integers satisfying the condition $x^2-y^2=12345678$. Then,

If $X = \{ {8^n} - 7n - 1:n \in N\} $ and $Y = \{ 49(n - 1):n \in N\} ,$ then

If $\mathrm{S}=\{\mathrm{a} \in \mathrm{R}:|2 \mathrm{a}-1|=3[\mathrm{a}]+2\{\mathrm{a}\}\}$, where $[\mathrm{t}]$ denotes the greatest integer less than or equal to $t$ and $\{t\}$ represents the fractional part of $t$, then $72 \sum_{\mathrm{a} \in \mathrm{S}} \mathrm{a}$ is equal to....................

Let $A_1, A_2, \ldots \ldots, A_m$ be non-empty subsets of $\{1,2,3, \ldots, 100\}$ satisfying the following conditions:

$1.$ The numbers $\left|A_1\right|,\left|A_2\right|, \ldots,\left|A_m\right|$ are distinct.

$2.$ $A_1, A_2, \ldots, A_m$ are pairwise disjoint.(Here $|A|$ donotes the number of elements in the set $A$ )Then, the maximum possible value of $m$ is

Let $A=\{n \in N: H . C . F .(n, 45)=1\}$ and Let $B=\{2 k: k \in\{1,2, \ldots, 100\}\}$. Then the sum of all the elements of $A \cap B$ is