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
disa [49]
3 years ago
10

Which ordered pair is a solution of the inequality?

Mathematics
1 answer:
Greeley [361]3 years ago
8 0

Answer:

<h2>d. (3, -11)</h2>

Step-by-step explanation:

y-1

You might be interested in
Using the Breadth-First Search Algorithm, determine the minimum number of edges that it would require to reach
jekas [21]

Answer:

The algorithm is given below.

#include <iostream>

#include <vector>

#include <utility>

#include <algorithm>

using namespace std;

const int MAX = 1e4 + 5;

int id[MAX], nodes, edges;

pair <long long, pair<int, int> > p[MAX];

void initialize()

{

   for(int i = 0;i < MAX;++i)

       id[i] = i;

}

int root(int x)

{

   while(id[x] != x)

   {

       id[x] = id[id[x]];

       x = id[x];

   }

   return x;

}

void union1(int x, int y)

{

   int p = root(x);

   int q = root(y);

   id[p] = id[q];

}

long long kruskal(pair<long long, pair<int, int> > p[])

{

   int x, y;

   long long cost, minimumCost = 0;

   for(int i = 0;i < edges;++i)

   {

       // Selecting edges one by one in increasing order from the beginning

       x = p[i].second.first;

       y = p[i].second.second;

       cost = p[i].first;

       // Check if the selected edge is creating a cycle or not

       if(root(x) != root(y))

       {

           minimumCost += cost;

           union1(x, y);

       }    

   }

   return minimumCost;

}

int main()

{

   int x, y;

   long long weight, cost, minimumCost;

   initialize();

   cin >> nodes >> edges;

   for(int i = 0;i < edges;++i)

   {

       cin >> x >> y >> weight;

       p[i] = make_pair(weight, make_pair(x, y));

   }

   // Sort the edges in the ascending order

   sort(p, p + edges);

   minimumCost = kruskal(p);

   cout << minimumCost << endl;

   return 0;

}

8 0
3 years ago
Anyone good with math??
-Dominant- [34]
Yup! We're all pretty good here.
7 0
3 years ago
3x-24 x+10 what is the value of x
Arisa [49]
3x-24=x+10
3x-x=24+10
2x=34
x=34:2=17
8 0
3 years ago
Read 2 more answers
X ⋅ x ⋅ x ⋅ x = ?<br> a: 4x <br> b: x(x+4)<br> c: x^4<br> d: x+4
sattari [20]
C would be the answer as x^{4} is the same thing as x * x * x * x.
3 0
3 years ago
Read 2 more answers
What is the volume of this rectangular prism?
qwelly [4]
What rectangular prims, what do you mean?!?
7 0
3 years ago
Other questions:
  • Patrick has 1 1/2 quarts of blue paint and 3 3/5 quarts of red paint. he mixes 2/3 of the blue paint and 5/6 of the red paint to
    5·1 answer
  • Rebecca has r number of crayons. Julie has 17 more crayons than Rebecca. Which expressions correctly show the number of crayons
    7·2 answers
  • Help please 10 minutes!!!!!!!!!
    7·1 answer
  • A circle has a radius of 5 inches. What is the circumference of the circle? Use 3.14 for pi.
    15·2 answers
  • One state leads the country in tart cherry​ production, producing 80 out of every 100 tart cherries each year. a. What percent o
    14·1 answer
  • What is the x-coordinate of the point that divides the directed line segment from K to J into a ratio of 1:3?
    7·2 answers
  • 127. Ladder stability: From past mishaps, Seth knows his
    10·1 answer
  • Please need help explanation need it
    5·1 answer
  • The length of a rectangle is two less than three times a number x and the width is five more than that same number. WHAT IS THE
    9·1 answer
  • Your purchase a T-shirt with a label pre-tax price of $17 the local sale price rate is 5% what is your final cost including tax
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!