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
kondor19780726 [428]
3 years ago
12

How many pounds of chocolate worth $1.5 a pound must be mixed with 10 pounds of chocolate worth 60 cents a pound to produce a mi

xture worth $1 a pound?
Please answer ASAP
Mathematics
1 answer:
Minchanka [31]3 years ago
8 0

Your rows would be $0.90 Chocolate, $1.20 Chocolate, and the Total Chocolate Mix, and your columns would be the Amount of Chocolate in #s and the Total Costs

(This is the best I can do coming up with a grid)

________________amt (#)_________total costs

$0.90_____________10______________9.00

$1.20______________x______________1.20x

 

Total Mix_________10+x_____________9+1.2x

Using this grid, you see that 10+x=9+1.2x so solve for x

10+x -x=9+1.2x -x

10=9+.2x

10 -9=9+.2x -9

1=.2x

1/.2=(.2x)/.2

x=5, so you need 5lbs of the $1.20 chocolate to produce a mixture worth $1.00

You might be interested in
Out of 1100 discs tested 13 are defective. Estimate the number of defective discs in a batch of 41000
zvonat [6]
I’d say 485 discs are defective out of 41000
5 0
3 years ago
What is the rule for the sequence with the first four terms below? 0.5, 0.25, 0, –0.25
elena55 [62]

Answer:

subtract .25 each time x-.25

Step-by-step explanation:

6 0
4 years ago
Determine the greatest common divisor of the elements of the set \[ s = \{ n^{13} - n \mid n \in \mathbb{z} \}. \]
Kay [80]

Answer:

2730

Step-by-step explanation:

We want to determine the greatest common divisor of the elements of the set  S = \{ n^{13} - n \mid n \in \mathbb{Z} \}.

We apply the Fermat's little theorem which states that if p is a prime number, then for any integer a, the number aᵖ − a is an integer multiple of p.

Now, n^{13} \equiv n \mod p if p-1 divides 12.

Since the  of 12 are 1,2,3,4, 6, 12, the corresponding primes are 2, 3, 5, 7, 13.

Therefore, the gcd of the elements in 2^{13}-2 and 3^{13}-3$ is 2 \cdot 3 \cdot 5 \cdot 7 \cdot 13.

2*3*5*7*13=2730

Therefore, the gcd of the elements in set S is 2730.

5 0
3 years ago
Please help or at least give me a clue, thanks
Paladinen [302]
The answer is b hope that helps
8 0
3 years ago
Help with rational equations
Sunny_sXe [5.5K]
Change all the terms so that they have a common denominator
7 0
4 years ago
Other questions:
  • Dee's clothing is having a discount of 40% on all shirts. Let x represent the regular price of any shirt in the store. Write an
    12·1 answer
  • PLEASE HELP ASAP
    12·1 answer
  • Rewrite the rational exponent as a radical by extending the properties of integer exponents.
    10·1 answer
  • How many units is 1 from -6 on a number line
    5·1 answer
  • How to write five million, forty thousand
    15·2 answers
  • X^2+ 6x - 4 = 3x + 6
    14·2 answers
  • How do you do all these problems? Don’t do 20 and 21.
    10·1 answer
  • Draw the image of ABC under a dilation whose center is P and scale factor is 1/3
    12·1 answer
  • Question 3
    5·1 answer
  • Z+w−3=k<br> 6z−10w=8<br><br> ​ <br><br><br> ​
    9·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!