Ask question

Ask question

All categories

2 years ago

15

A lock has a two digit numeric code, with the numbers 1 through 6 available for each digit of the code. Note that numbers can be

repeated in the code, so there are 6 possibilities for each of the two digits. Find the total number of possible codes for the lock.

1 answer:

Ede4ka [16]2 years ago

8 0

There are 36 possible codes for this

You might be interested in

7. In A.ABC. JB and KA are medians, JK = 10x - 12, AB = 9x + 18, JM = 21, KM = 23. AJ = 60. and

Juliette [100K]

Answer:

A) JK and AB =

$[tex] \boxed{( \theta) = \f{12}{( \theta)} }$ So, =》 $\dfrac{10}{5} = \dfrac{1}{ \( \theta) }$ =》 $\( \theta) = \dfrac{5}{2}$ [/tex]

B) AABC

$[tex] \boxed{( \theta) = {1}{( \theta)} }$ So, $23}{-18=\\Ans } \boxed$

C) AABM:

$[tex] e \fbox{: }$ The value of k for which $\sin(jm) = \cos(x)$ is $\dfrac{\p}{2}$ ans[/tex]

----------

3 0

3 years ago

Question about a rational expression

sesenic [268]

-9=6/v

You have to multiply v both sides because
6/v x v = 6 and helps you get rid of the v on the right side.
If you multiply by 6, 6/v x 6 = 36/v, that’s why it don’t work.

Answer:
-9=6/v
-9v=6
v=-6/9
v=-2/3

3 0

2 years ago

I need to now why won’t I rank up I have 1500 points and 10/10 brainliest and I need to now why won’t I rank up to expert

irinina [24]

Answer:

it was doing that to me too, you just have to keep answering and eventually it will come i was waiting a week on virtuoso with all the points and brainliest i needed

Step-by-step explanation:

7 0

3 years ago

Read 2 more answers

In a chess variant, a "lord" can move one space at a time, either upward, or to the right, or diagonally up and to the right. ho

valentina_108 [34]

There are 48639 ways for a lord to move from the bottom left to top right corner of the 8 by 8 chessboard

<h3>Further explanation</h3>

The probability of an event is defined as the possibility of an event occurring against sample space.

$\large { \boxed {P(A) = \frac{\text{Number of Favorable Outcomes to A}}{\text {Total Number of Outcomes}} } }$

<h2>Permutation ( Arrangement )</h2>

Permutation is the number of ways to arrange objects.

$\large {\boxed {^nP_r = \frac{n!}{(n - r)!} } }$

<h2>Combination ( Selection )</h2>

Combination is the number of ways to select objects.

$\large {\boxed {^nC_r = \frac{n!}{r! (n - r)!} } }$

Let us tackle the problem.

This problem is similar to Pascal Triangle.

The Lord can move to the right or up in one way only.

We can put "1" in each box on the bottom and left to represent 1 possible movement.

To get the possibility of movement to another box, we will add the possibility of movement to the left, right, and diagonal squares as shown in Figure 1.

This process is repeated for the next box as shown in Figure 2.

Finally, after this process is repeated until the top right box, we get the results as shown in Figure 3.

There are 48639 ways for a lord to move from the bottom left to top right corner of the 8 by 8 chessboard.

<h3>Learn more</h3>

Different Birthdays : brainly.com/question/7567074
Dependent or Independent Events : brainly.com/question/12029535
Mutually exclusive : brainly.com/question/3464581

<h3>Answer details</h3>

Grade: High School

Subject: Mathematics

Chapter: Probability

Keywords: Probability , Sample , Space , Six , Dice , Die , Binomial , Distribution , Mean , Variance , Standard Deviation

7 0

3 years ago

Suppose there is a 1.4°F drop in temperature for every thousand feet that an airplane climbs into the sky. If the temperature on

dedylja [7]

Answer I don't know

Step-by-step explanation:

and i don't know

6 0

3 years ago