All categories

2 years ago

Determine whether 5, 238 is divisible by 2, 3, 4, 5, 6, 9, or 10.

Mathematics

1 answer:

Gelneren [198K]2 years ago

5 0

Answer:

2, 3, 6

Step-by-step explanation:

Simply try each value using long division.

Since 5,238 ends in an even number, that automatically means it is divisible by 2.

5238/2=2619

Now for 3:

5238/3=1746 no remainder or decimal, so 3 also works

You can either do long division again with 4, or you can see if 5238 divided by 2 (5238/2) is also divisible by 2. Since 2619 doesn't end in an even number, 4 is a no go.

Long division 5238/4=1309.5 decimal here, so 4 isn't an answer

This is also very easy, simply check if the number ends in 0 or 5. Since 5,238 does not, 5 doesn't work either.

You can do the same thing as with 4, except this time trying to find if 5238 divided by 3 (5238/3) is divisible by 2. Since 1746 ends in an even number, 6 also works.

Long division: 5238/6=873

You can do the same thing as with 6, except this time trying to find if 5238 divided by 3 (5238/3) is divisible by 3.

1746/3=548 with a remainder of 2, which means 9 doesn't work

Long division: 5238/9=548.66 repeating

10:

Finally, 10 is another easy one. Simply check if the number ends in 0. 5,238 does not, so 10 doesn't work.

You might be interested in

125 cm to 87.4 cm percent of change

netineya [11]

Answer:

% Change = (87.5 - 125) / 125 * 100%

= -37.5 / 125 * 100%

= -0.3 * 100%

= -30 %

The percent change is -30 % or 30% decrease.

4 0

3 years ago

HELLLLLLLPPPPPPPPPPPP PLEASEEEEEEEEEE.

TiliK225 [7]

okay 1 student = 1/20 chance of picking yellow

1/20 (30/30) = 30/600 chance of picking yellow out of 30 studnets

30/600 = 0.05 = 5% chance of choosing yellow.

I each studnet picks 1 yellow marker. Is that all the options?

7 0

2 years ago

Read 2 more answers

Round 0.971 to the nearest tenth

Flura [38]

Answer:

1.0

Step-by-step explanation:

You are rounding to the nearest tenth, so you should have only 2 places remaining (0.0). So, you look to the 7 to change the 9. 7 is bigger than 5, so you round 9 up. Since 9 plus 1 equals 10, the final answer is 1.0.

Hope this helps! :)

5 0

3 years ago

Read 2 more answers

What is the length of segment AB? (4 points)

Sveta_85 [38]

Answer:

10 units

Step-by-step explanation:

$\sqrt{(0-6)^{2} +(10-2)^{2} }\\\\\sqrt{(-6)^{2}+(8)^{2} } \\\\\sqrt{36+64}\\\\\sqrt{100}\\\\10$

3 0

3 years ago

There are eight different jobs in a printer queue. Each job has a distinct tag which is a string of three upper case letters. Th

N76 [4]

Answer:

a. 40320 ways

b. 10080 ways

c. 25200 ways

d. 10080 ways

e. 10080 ways

Step-by-step explanation:

There are 8 different jobs in a printer queue.

a. They can be arranged in the queue in 8! ways.

No. of ways to arrange the 8 jobs = 8!

= 8*7*6*5*4*3*2*1

No. of ways to arrange the 8 jobs = 40320 ways

b. USU comes immediately before CDP. This means that these two jobs must be one after the other. They can be arranged in 2! ways. Consider both of them as one unit. The remaining 6 together with both these jobs can be arranged in 7! ways. So,

No. of ways to arrange the 8 jobs if USU comes immediately before CDP

= 2! * 7!

= 2*1 * 7*6*5*4*3*2*1

= 10080 ways

c. First consider a gap of 1 space between the two jobs USU and CDP. One case can be that USU comes at the first place and CDP at the third place. The remaining 6 jobs can be arranged in 6! ways. Another case can be when USU comes at the second place and CDP at the fourth. This will go on until CDP is at the last place. So, we will have 5 such cases.

The no. of ways USU and CDP can be arranged with a gap of one space is:

6! * 6 = 4320

Then, with a gap of two spaces, USU can come at the first place and CDP at the fourth. This will go on until CDP is at the last place and USU at the sixth. So there will be 5 cases. No. of ways the rest of the jobs can be arranged is 6! and the total no. of ways in which USU and CDP can be arranged with a space of two is: 5 * 6! = 3600

Then, with a gap of three spaces, USU will come at the first place and CDP at the fifth. We will have four such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 4 * 6!

Then, with a gap of four spaces, USU will come at the first place and CDP at the sixth. We will have three such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 3 * 6!

Then, with a gap of five spaces, USU will come at the first place and CDP at the seventh. We will have two such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 2 * 6!

Finally, with a gap of 6 spaces, USU at first place and CDP at the last, we can arrange the rest of the jobs in 6! ways.

So, total no. of different ways to arrange the jobs such that USU comes before CDP = 10080 + 6*6! + 5*6! + 4*6! + 3*6! + 2*6! + 1*6!

= 10080 + 4320 + 3600 + 2880 + 2160 + 1440 + 720

= 25200 ways

d. If QKJ comes last then, the remaining 7 jobs can be arranged in 7! ways. Similarly, if LPW comes last, the remaining 7 jobs can be arranged in 7! ways. so, total no. of different ways in which the eight jobs can be arranged is 7! + 7! = 10080 ways

e. If QKJ comes last then, the remaining 7 jobs can be arranged in 7! ways in the queue. Similarly, if QKJ comes second-to-last then also the jobs can be arranged in the queue in 7! ways. So, total no. of ways to arrange the jobs in the queue is 7! + 7! = 10080 ways

3 0

3 years ago