Keyless door entries require you to input your 6 digit passcode in the correct order. How many different 6 digit passcodes can be created from 10 digits, if all of the digits must be distinct? Give your answer in simplest form.

Provide your answer below:

151200

Step-by-step explanation:

We want to know how many permutations of 6 digits can be chosen from 10 different digits, so we use the formula:

nPr=n!(n−r)!

Here, r=6 and n=10, so we have:

10P6=10!(10−6)!=10!4!=10⋅9⋅8⋅7⋅6⋅5⋅4!4!=151,200

let's add {f(x)=x+1}f(x)=x+1 and {g(x)=2x}g(x)=2x together to make a new function.

f(x)+g(x) =(x+1)+(2x)=x+1+2x=3x+1

let's call this new function hh. so we have:

{h(x)}={f(x)}+{g(x)}{=3x+1}h(x)=f(x)+g(x)=3x+1

we can also evaluate combined functions for particular inputs. let's evaluate function hh above for x=2x=2. below are two ways of doing this.

method 1: substitute x=2x=2 into the combined function hh.

h(x)

h(2)

​    

=3x+1

=3(2)+1

=7

​ since h(x)=f(x)+g(x)h(x)=f(x)+g(x), we can also find h(2)h(2) by finding f(2) +g(2)f(2)+g(2).

first, let's find f(2)f(2):

f(x)

f(2)

​    

=x+1

=2+1

=3

​  

now, let's find g(2)g(2):

g(x)

g(2)

​    

=2x

=2⋅2

=4

​  

so f(2)+g(2)=3+4=\greend7f(2)+g(2)=3+4=7.

notice that substituting x =2x=2 directly into function hh and finding f(2) + g(2)f(2)+g(2) gave us the same answer!

step-by-step explanation: s