Question

An ethical hacker finds that a four digit passkey is a multiple of 3 and all its digits are distinct even digits. What is the maximum number of attempts required to be sure of the passkey? a. 24 b. 46 C. 47 d. 48​

Answer 1

Answer:

152 Verify Rolle's theorem for the function f(x) = x2 - 4x + 10 on (0,4)

152 Verify Rolle's theorem for the function f(x) = x2 - 4x + 10 on (0,4)152 Verify Rolle's theorem for the function f(x) x2 - 4x + 10 on (0,4)

152 Verify Rolle's theorem for the function f(x) = x2 - 4x + 10 on (0,4)

152 Verify Rolle's theorem for the function f(x) = x2 - 4x + 10 on (0,4)152 Verify Rolle's theorem for the function f(x) x2 - 4x + 10 on (0,4)

152 Verify Rolle's theorem for the function f(x) = x2 - 4x + 10 on (0,4)

152 Verify Rolle's theorem for the function f(x) = x2 - 4x + 10 on (0,4)152 Verify Rolle's theorem for the function f(x) x2 - 4x + 10 on (0,4)

152 Verify Rolle's theorem for the function f(x) = x2 - 4x + 10 on (0,4)

152 Verify Rolle's theorem for the function f(x) = x2 - 4x + 10 on (0,4)152 Verify Rolle's theorem for the function f(x) x2 - 4x + 10 on (0,4)

152 Verify Rolle's theorem for the function f(x) = x2 - 4x + 10 on (0,4)

152 Verify Rolle's theorem for the function f(x) = x2 - 4x + 10 on (0,4)152 Verify Rolle's theorem for the function f(x) x2 - 4x + 10 on (0,4)

152 Verify Rolle's theorem for the function f(x) = x2 - 4x + 10 on (0,4)

152 Verify Rolle's theorem for the function f(x) = x2 - 4x + 10 on (0,4)152 Verify Rolle's theorem for the function f(x) x2 - 4x + 10 on (0,4)

Answer 2

Given:

No. of digits in passkey: 4

All digits are distinct and  multiples of 3

To find:

Maximum number of attempts required to find the right combination

Solution:

According to the question, only 4 digits can make up the passkey.

The single-digit multiples of 3 are: 0, 3, 6, 9

Since all these digits are used only once, the number of possible combinations is= 4! = 4 x 3 x 2 x 1

= 24

Hence, the maximum number of attempts required to be sure of the passkey is 24.