If

15 × 14 × 13 × ... × 3 × 2 × 1 = 3^m × n

where m and n are positive integers, then what is the maximum value of m?

One non-zero digit, one vowel and one consonant from English alphabet (in capital) are to be used in forming passwords, such that each password has to start with a vowel and end with a consonant. How many such passwords can be generated?

There are 9 cups placed on a table arranged in equal number of rows and columns out of which 6 cups contain coffee and 3 cups contain tea. In how many ways can they be arranged so that each row should contain at least one cup of coffee?

Consider all 3-digit numbers (without repetition of digits) obtained using three non-zero digits which are multiples of 3. Let S be their sum.

Which of the following is/are correct?

1. S is always divisible by 74.

2. S is always divisible by 9.

select the correct answer using the code given below: