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
Soloha48 [4]
3 years ago
5

IM GIVING 30 POINTS PLZ HELP ASAP GIVING BRAIN TOO!

Mathematics
1 answer:
yawa3891 [41]3 years ago
3 0

Answer:

<em>x</em> = 28 Hours

Step-by-step explanation:

if you start with 20 bags done then you take that away from the 1000 and you have 980. Then you do  35x <em>x </em>or 35x28 = 980.

You might be interested in
Y=x^4-x^3-5x^2-x-6<br> Show steps
Nat2105 [25]

Answer:

The roots (zeros) are the x values where the graph intersects the x-axis. To find the roots (zeros), replace y with 0 and solve for x. x= i, −i, 3,−2

Step-by-step explanation:

3 0
2 years ago
Read 2 more answers
How do you simplify radical 32
EleoNora [17]
\sqrt{32}=  \sqrt{16*2}= \sqrt{16}* \sqrt{2}=4 \sqrt{2}
4 0
3 years ago
X=2y=14 and x-3y=-11
levacccp [35]
X - 2y= 14
x - 3y= - 11   | * ( -1)

x - 2y = 14
-x + 3y= 11
----------------
/    y= 25

x - 2*25= 14
x - 50 =14
x= 14+50
x=64

7 0
3 years ago
Help<br><br> Use the Distributive Property to rewrite the expression <br> -8(a + b) =
Delicious77 [7]

Answer:

-8a-8b

Step-by-step explanation:

You would first distribute -8 into the parenthesis:

a(-8)+b(-8)\\-8a-8b

7 0
3 years ago
Without using a division or multiplication operator and without using iteration , define a recursive method named product that a
Fantom [35]

I will be using the language C++. Given the problem specification, there are an large variety of solving the problem, ranging from simple addition, to more complicated bit testing and selection. But since the problem isn't exactly high performance or practical, I'll use simple addition. For a recursive function, you need to create a condition that will prevent further recursion, I'll use the condition of multiplying by 0. Also, you need to define what your recursion is.
To wit, consider the following math expression 
 f(m,k) = 0 if m = 0, otherwise f(m-1,k) + k 
 If you calculate f(0,k), you'll get 0 which is exactly what 0 * k is. 
 If you calculate f(1,k), you'll get 0 + k, which is exactly what 1 * k is.   
 So here's the function   
 int product(int m, int k) 
 { 
  if (m == 0) return 0; 
  return product(m-1,k) + k;  
}
8 0
3 years ago
Other questions:
  • 4 red marbles, 6 blue marbles, and 9 yellow marbles. what is the ratio of red marbles to blue marbles
    7·2 answers
  • D = 8 cm<br> h = 18 cm<br> What is the surface area of the cylinder
    8·1 answer
  • "In this group discussion technique, the group leader states the problem in a clear manner so all participants understand. Membe
    10·1 answer
  • Can someone please help
    14·1 answer
  • WILL MARK BRAINLIEST!!! NEED QUICKLY <br> Look at attachment
    10·2 answers
  • Charge q is one unit of distance away from the source charge s. Charge p is two times further away. The force exerted between S
    10·1 answer
  • Find the midpoint of the segment that has endpoints at<br> (a+b, a-b) and (a, b).
    13·1 answer
  • Identify each pair of angles as corresponding, alternate interior, alternate exterior, or consecutive interior.
    6·1 answer
  • A triangular bandana has an area of 54 square inches. The height of the triangle is
    12·1 answer
  • What is ∑n=17(10n+90) equal to?<br><br> Enter your answer in the box.
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!