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
natita [175]
3 years ago
8

Ethan goes to a store an buys an item that costs x dollars. He has a coupon for 5% off, and then a 9% tax is added to the discou

nted price. Write an expression in terms of x that represents the total amount that Ethan paid at the register.
Mathematics
1 answer:
choli [55]3 years ago
8 0
Well Ethan’s pretty cool
You might be interested in
A chef uses 4 3/4 cups of broth for 10 servings of soup. How much broth is used in one serving of soup?
sukhopar [10]

Answer:

43

hi

hi

hi

hi

Step-by-step explanation:

3 0
2 years ago
Answers+steps please?
koban [17]
A) 40 feet
B) 1 second
C) 56 feet

3 0
2 years ago
Phân tích thành nhân tử <br> 3+√5 +3√5 +5
Lyrx [107]

Step-by-step explanation:

3+√5+3√5+5

=6√5+5

=6√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
Find the indicated real nth root(s) of a. n=3, a=729
marissa [1.9K]

Answer:

9

Step-by-step explanation:

n=3, a=729

For any odd integer, n ; a will have only one real nth root which will be a positive integer.

Similarly, for any integer, n, that is > 1 ; related by the expression ;

p^n = a ; the nth root of a = p

Therefore,

If n = 3 ; a = 729

p^3 = 729

To obtain the value of p ; take the cube of both sides

(p^3)*1/3 = 729^1/3

p = 9

Hence, the real nth root of 729 is +9 when n = 3

6 0
2 years ago
Other questions:
  • Find the equation of the line parallel to y = 2x + 8 and passes through (4, - 6)
    14·1 answer
  • Given the two parallel lines determine the value of x
    6·1 answer
  • 4e+7e+5 what would be the coeffients
    11·2 answers
  • Believe the answer is A can anyone check me and make sure that is correct? thank you.
    14·2 answers
  • Which theorem can be used to show that AJKL - AMNP?
    7·1 answer
  • SCHOOL Half of the students in Max’s class volunteer at the local community center. Fifteen students do not volunteer. If there
    11·1 answer
  • Please help I’m being timed
    5·1 answer
  • 25 Will give BRAINLIST to best answer
    8·1 answer
  • 26x32+2223-100 divided by 34
    5·2 answers
  • How do I solve this, it's not 10
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!