1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Amanda [17]
3 years ago
13

6,057 round it to the nearest thousands

Mathematics
2 answers:
iren [92.7K]3 years ago
6 0

Answer: 6,000.

Step-by-step explanation:

ohaa [14]3 years ago
6 0

Answer:

6,000 is the Answer

Step-by-step explanation:

I dont know I just copied

You might be interested in
What is the intercepts of the line?
xxTIMURxx [149]

Answer:

The y-intercept is 2.5

The x-intercept is 3.5

Step-by-step explanation:

Hope this helps!

8 0
2 years ago
Read 2 more answers
The gandhara region is the home of many portrayals of ____.
Alexandra [31]
BUDDHA. It is a cold climate region where many BUDDHA carvings, with simplistic  garments and appearance can be seen. This also exemplifies Gandhara art work that is usually influenced by roman empire.
3 0
3 years ago
The following correlations were computed as part of a multiple regression analysis that used education, job, and age to predict
erma4kov [3.2K]

Answer:

Job has the weakest association with the dependent variable income.

Step-by-step explanation:

The correlation coefficient is used to determine the the strength and direction of the relationship between two variables.

It is denoted by <em>r</em> and the value of <em>r</em> ranges from -1.00 to 1.00.

The correlation data provided is as follows:

                    Income    Education    Job     Age

Income         1.000      

Education     0.677        1.000

Job                0.173         -0.181        1.000

Age               0.369        0.073        0.689   1.000

The dependent variable is the income.

And the variables Education, Job and Age are independent variables.

The correlation between Income and Job is 0.173.

This is the lowest correlation coefficient between the dependent and independent variable.

Thus, Job has the weakest association with the dependent variable income.

8 0
3 years ago
Ms wilson surveyed her class of 36 students about their favorite icecream flavors. Two thirds preferred chocolate. One fourth pr
mafiozo [28]
Answer- 9 students preferred vanilla
Hope this Helps! :)
3 0
3 years ago
Read 2 more answers
A search committee is formed to find a new software engineer. (a) If 100 applicants apply for the job, how many ways are there t
vagabundo [1.1K]

These are three questions with three complete answers.

Answers:

(a) C(100,6) = 100! / [ 9! × (100 -9)! ] =

              = (100×99×98×97×96×95×94×93×92) / (9×8×7×6×5×4×3×2×1) =

              = 1,902,231,808,400

(b) C(9,6) = 9! / [ 6! * (9 - 6)! ] = 9! / [6! 3!] = (9 × 8 × 7 × 6!) (6! × 3 × 2 × 1) =

          =  (9 × 8 × 7 × 6!) (6! × 3 × 2 × 1) =  (9 × 8 × 7 ) / (3 × 2 × 1) = 84

(c) P(6,3) = 6! / (6 - 3)! = 6! / 3! = (6 × 5 × 4 × 3!) / 3! = 120

Step-by-step explanation:

(a) If 100 applicants apply for the job, how many ways are there to select a subset of 9 for a short list?

This is the formula for combinations: C (m,n) = m! / [n! (m - n)! ].

We will also use the formula for permutations, only as an intermediate step, to explain the solution. The formula for permutations is: P (m,n) = m! / (m - n)!

Next you will see why the final formula that you can use to solve the problem is that of combinations (because the order in which you make the list does not matter) and how you use it.

You have to select a subset of 9 candidates from a list of 100 applicants.

The first candidate may be chosen from the 100 different applicants, the second candidate may be chosen from the 99 left applicants, the third candidate from 98 applicants, and so on, which leads to:

  • 100 × 99 × 98 × 97 × 96 × 95 × 94 × 93 × 92 possible variants.

Note that this is the permutation of 100 candidates taken from 9 in 9:

P(100,9)  = 100! (100 - 9)! = 100! / (91!) =

              = 100 × 99 × 98 × 97 × 96 × 95 × 94 × 93 × 92 × 91! / 91! =

              = 100× 99 × 98 × 97 × 96 × 95 × 94 × 93 × 92.

But you have to eliminate the repetitions!

Suppose that A, B, C, D, E, F, G, H, I represents the set formed by nine selected members whose names are A, B, C, D, E, F, G, H and I. So, any combination of those same names, written in different order, represents the same set (list). That means that there are 9! = 9× 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 equivalent lists.

That is why you must divide the first result (possible ways in which you can select nine candidates) by the number of ways that represent the same list for every set.

So, the conclusion is that the number of different lists of nine candidates is:

C(100,6) = 100! / [ 9! × (100 -9)! ] =

              = (100×99×98×97×96×95×94×93×92) / (9×8×7×6×5×4×3×2×1) =

              = 1,902,231,808,400

(b) If 6 of the 9 are selected for an interview, how many ways are there to pick the set of people who are interviewed? (You can assume that the short list is already decided).

Since, the short list, i.e. the  subset of 9 candidates is already decided, you will select 6 candidates to interview from 9 possible candidates.

So, your final set of candidates to interview will be the combination of 9 candidates taken from 6 in 6. The order of the names A, B, C, D, E, F, and G, is not relevant, and, therefore, the formula to use is that of combinations:

  • C (m,n) = m! / [n! (m - n)! ]

  • C(9,6) = 9! / [ 6! * (9 - 6)! ] = 9! / [6! 3!] = (9 × 8 × 7 × 6!) (6! × 3 × 2 × 1) =

                   =  (9 × 8 × 7 × 6!) (6! × 3 × 2 × 1) =  (9 × 8 × 7 ) / (3 × 2 × 1) = 84

(c) Based on the interview, the committee will rank the top three candidates and submit the list to their boss who will make the final decision. (You can assume that the interviewees are already decided.) How many ways are there to select the list from the 6 interviewees?

Ranking the top three candidates means that the order matters. Because it is not the same A, B, C than A, C, B, nor B, A, C, nor B, C, A, nor C, A, B, nor C, A, B.

Hence, you have to use the formula for permutations (not combinations).

The formula is: P(m,n) = m! / (m - n)!

Here, you must rank (select) 3 names, from a set (list) of 6 names, and the formula yields to:

  • P(6,3) = 6! / (6 - 3)! = 6! / 3! = (6 × 5 × 4 × 3!) / 3! = 120

4 0
2 years ago
Other questions:
  • It is cloudy outside. <br><br> What is the first step of indirectly proving this statement?
    10·1 answer
  • Name three real life situations in which you would use a positive number
    5·1 answer
  • 4)<br> At a store, pears cost $0.74 per<br> pound. How much will 3.5<br> pounds of pears cost?
    12·1 answer
  • Each year at a college, there is a tradition of having a hoop rolling competition.
    11·2 answers
  • Which linear inequality is represented by the graph?
    11·2 answers
  • HELP IM BEING TIMEDDDD
    5·2 answers
  • Challenge #1
    7·1 answer
  • Work out the equation of<br> the line that goes through<br> (3, 2) and (-1, 10)
    10·2 answers
  • Which one is the answer (the answers are on the picture)
    5·2 answers
  • (08.06)
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!