A, B and C are three places such that there are three different roads from A to B, four different roads from B to C and three different roads from A to C. In how many different ways can one travel from A to C using these roads?

Let A, B and C represent distinct non-zero digits. Suppose x is the sum of all possible 3-digit numbers formed by A, B and C without repetition.

Consider the following statements :

1. The 4-digit least value of x is 1332.

2. The 3-digit greatest value of x is 888.

Which of the above statements is/are correct?

There is a numeric lock which has a 3-digit PIN. The PIN contains digits 1 to 7. There is no repetition of digits. The digits in the PIN from left to right are in decreasing order. Any two digits in the PIN differ by at least 2. How many maximum attempts does one need to find out the PIN with certainty?

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?