`n` is selected from the set `{1, 2, 3,.............,100}` and the number `2^n+3^n+5^n` is formed. Total number of ways of selecting `n` so that the formed number is divisible by 4 is equal to `(A)` 50 `(B)` 49 `(C)` 48 `(D)` None of these.

Consider a number N = 2 1 P 5 3 Q 4. The number of ordered pairs (P,Q) so that the number 'N' is divisible by 44, is

Consider a number n=21 P 5 3 Q 4. The number of values of Q so that the number 'N' is divisible by 8, is

Consider a number N=21 P 5 3 Q 4. The number of ordered pairs (P,Q) so that the number' N' is divisible by 9, is

Total number of 480 that are of the form 4n+2, n ge 0 , is equal to

The number of ordered pairs (m,n),m,n in{1,2,...,100} such that 7^m + 7^n is divisible by 5 is

The total number of ways of selecting two numbers from the set {1,2, 3, 4, ........3n} so that their sum is divisible by 3 is equal to a. (2n^2-n)/2 b. (3n^2-n)/2 c. 2n^2-n d. 3n^2-n

Which of the following is not the number of ways of selecting n objects from 2n objects of which n objects are identical

S is a set containing n elements. A subset AS of S is selected . The set S is reconstructed by replacing the elements of A.A subset B of S is now selected. If the numer of ways of selecting subsets A and B of S such that AcapB=phi is 81, then n= (A) 3 (B) 4 (C) 5 (D) none of these

If the number of ways of selecting r balls with replcement out of n balls numbered 1,2,3……,100 such that the largest number selected is 10 is 271, then r= (A) 4 (B) 5 (C) 3 (D) none of these

If n_1 and n_2 are five-digit numbers, find the total number of ways of forming n_1 and n_2 so that these numbers can be added without carrying at any stage.