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
olga55 [171]
3 years ago
15

Please help me I begging youI just need to do this then I’m done I really want to go to sleep

Mathematics
1 answer:
PilotLPTM [1.2K]3 years ago
6 0
Slope: 3, y-intercept: 4, equation: y = 3x + 4
You might be interested in
A chain has a ribbon tied to it every 2/3 foot. If the chain is 10 2/3 feet long, how many ribbons are tied to the chain??
patriot [66]

Answer:

16 ribbons

Step-by-step explanation:

Given the length of the chain as 10\frac{2}{3} and there is a ribbon tied to it every \frac{2}{3}, we can take the total length of the chain and divide by the measure of \frac{2}{3}:

10\frac{2}{3}=\frac{32}{3}

\frac{\frac{32}{3}}{\frac{2}{3}}=\frac{32}{3}*\frac{3}{2}=\frac{96}{6}=16

When dividing with fractions, we use the rule of 'keep/change/flip' to keep the first fractions, change the operation to multiplication and flip the second fraction.  

7 0
3 years ago
The post office is now calculating the volume of packages to determine the shipping cost. If a box measures 8 ½ inches long, 5 ¼
4vir4ik [10]
ANSWER: 312 3/8
So Volume is Length • Width • Height

So first we would put it into this formula:
8.5 • 5.25 • 7= 312.375, or, 312 3/8
4 0
3 years ago
Can someone help me? It’s Geometry !
Alenkinab [10]

Answer:

answer is 175

Step-by-step explanation:

i solved it by similarity in triangle small triangle and big triangle are similar to each other.

3 0
3 years ago
Question 31 pts Prove the statement is true using mathematical induction: 2n-1 ≤ n! Use the space below to write your answer. To
Sladkaya [172]

Answer:

P(3) is true since 2(3) - 1 = 5  < 3! = 6.  

Step-by-step explanation:

Let P(n) be the proposition that 2n-1 ≤ n!. for n ≥ 3

Basis: P(3) is true since 2(3) - 1 = 5  < 3! = 6.  

Inductive Step: Assume P(k) holds, i.e., 2k - 1 ≤ k! for an arbitrary integer k ≥ 3. To show that P(k + 1) holds:

2(k+1) - 1 = 2k + 2 - 1

≤ 2 + k! (by the inductive hypothesis)

= (k + 1)! Therefore,2n-1 ≤ n! holds, for every integer n ≥ 3.

4 0
2 years ago
Please help and answer the table
anastassius [24]
The table on the left is going up by 9, and the other side is going up by 4. So in 12 hours you made 27.. sorry if that is bad
6 0
3 years ago
Read 2 more answers
Other questions:
  • The domain of discourse is sets. Suppose some predicate Q is true for all elemenst of A: ∀a ∈ A Q(a). Recall the definition of s
    8·1 answer
  • If DM = 45, what is the value of r?<br> r+ 3<br> 4r - 28
    5·1 answer
  • What is greater 20.4 or 0.75
    10·2 answers
  • BRAINLIEST!!!
    5·1 answer
  • Sara can finish 5 laps around the track in 6 minutes. What is her average speed in miles per hour, if it takes 12 laps around th
    8·1 answer
  • 2. Solve the system of equations using the substitution method.
    8·1 answer
  • Your teacher wants to encourage you to work harder. Which measure should your teacher use? Explain.
    12·2 answers
  • There are 60 minutes in an hour the total number of minutes is a function of the number of hours as shown in the table does the
    12·2 answers
  • A roll of 100 pennies is in the shape of a right cylinder. Each penny has a diameter of 0.75 inches and a thickness of 0.04 inch
    6·2 answers
  • I need help!
    8·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!