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
WITCHER [35]
1 year ago
9

I need help asap please

Mathematics
1 answer:
SCORPION-xisa [38]1 year ago
3 0

Answer:  (2, 3)  (3, 6)  and (6, 3)

 

Step-by-step explanation:

 i think those are it i dont really know for shure

You might be interested in
To mix plaster for a dental model, 45 milliliters (mL) of water are used for 100 grams (g) of plaster. How many milliliters (mL)
Tomtit [17]
\begin{array}{ccc}45\ ml&-&100\ g\\\\x\ ml&-&250\ g\end{array}\ \ \ |cross\ multiply\\\\\\100\cdot x=45\cdot250\\\\100x=11,250\ \ \ |divide\ both\ sides\ by\ 100\\\\\huge\boxed{x=1,125\ (ml)}
6 0
3 years ago
A supermarket offers a delivery service. If a customer pays $9 per month, each delivery costs just $2. Write an equation that sh
Rzqust [24]

The linear function that models the total cost for x deliveries is:

y(x) = 2x + 9

-------------------

A linear function has the following format:

y = mx + b

In which

  • m is the slope, that is, the rate of change.
  • b is the y-intercept, that is, the value of y when x = 0.

In this problem:

  • Fixed cost of $9 per month, b = 9.
  • Cost of $2 for each delivery, thus m = 2.

The function for the <u>total cost for x deliveries is:</u>

y(x) = 2x + 9

A similar problem is given at brainly.com/question/16270359

4 0
2 years ago
Let G be a connnectde graph with n vertices and m edges. supposed also that m = n. prove that G contains exactly one cycle
ElenaW [278]

Answer:

Contradiction

Step-by-step explanation:

Suppose that G has more than one cycle and let C be one of the cycles of G, if we remove one of the edges of C from G, then by our supposition the new graph G' would have a cycle. However, the number of edges of G' is equal to m-1=n-1 and G' has the same vertices of G, which means that n is the number of vertices of G. Therefore, the number of edges of G' is equal to the number of vertices of G' minus 1, which tells us that G' is a tree (it has no cycles), and so we get a contradiction.

7 0
3 years ago
PLEASE HELP ME !!!! WILL GIVE BRAINLIEST TO WHOEVER ANSWERS CORRECTLY
Margarita [4]

Answer:

(8x + 1)° + ( 4x+11)° = 180° (linear pair )

8x +1 + 4x +11 = 180

8x + 4x + 1 + 11 = 180

12x + 12 = 180

12x = 180 - 12

12x = 168

x= 168/12

x = 14

3 0
3 years ago
Piper is helping her dad lay out purple tiles to make completed they have done all of this they are 16 tiles and they filled it
9966 [12]

Answer:

9 tiles needed to fill

Step-by-step explanation:

16 - 7

6 0
3 years ago
Other questions:
  • Simplify the expression 2x - 4 + 3x
    12·2 answers
  • Which of the following terms best describes three points that all lie in a straight line
    13·2 answers
  • WATER TOWER One of the largest sphere water towers in the country is located in Edmond, Oklahoma. It is 218 feet tall and holds
    8·1 answer
  • Find the value of x and the value of y. (3y) (y+140) (5x-100) (x-20)
    6·1 answer
  • This morning the owner of sams spaghetti house withdrew $180 from the restaurants bank account to pay for an oven repair this af
    13·1 answer
  • During 2018, Towson Company had credit sales of $54,000 and cash sales of $14,000. In 2018 Towson collected $31,000 of accounts
    9·1 answer
  • Round off the number 0.007326 correct to 3 significant figures 3 decimal places​
    7·1 answer
  • A - 57 7/9<br> B- 11 2/3<br> C- 48 2/9<br> D-28 2/3
    6·2 answers
  • PROBLEM 1
    14·1 answer
  • Please help me with this !!!
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!