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
inysia [295]
3 years ago
5

Write 2 mixed numbers where the lcd is 12,but the product of the denominators is not 12

Mathematics
1 answer:
timama [110]3 years ago
4 0
1/6 and 2/3 the LCD is 12 but the product of 6 and 3 is not 12
You might be interested in
Need help ASAP 19=10-5w+9w-7
REY [17]

Answer:

4w+3=19

4w=16

w=4


Step-by-step explanation:


6 0
3 years ago
Read 2 more answers
The picture above tap and tell me yes or no in order thank you :)
artcher [175]

Step-by-step explanation:

no,yes,no, d is probably yes I guess

4 0
2 years ago
Read 2 more answers
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
Using a compass, construct an accurate copy of triangle DEF. Check that EF = 4.6 cm. ​
MaRussiya [10]

Step-by-step explanation:

construct 90° then measure 4.6 cm and draw a line from F to D

5 0
2 years ago
A coin is tossed 5 times and a tail is the outcome each time. what is the probability of getting a tail on the sixth throw
Norma-Jean [14]
I believe it would be
1/5
5 0
3 years ago
Other questions:
  • Jaylen has decided to purchase a $14,750 car and would like to finance it for
    10·1 answer
  • Which of the following correctly justifies statement 4 of the two-column proof? Lines JK and LM are intersected by transversal J
    6·2 answers
  • A box of crayons costs $1.75, including tax. Mr. Valentino wants to purchase boxes of crayons for his class and has a $25 budget
    8·1 answer
  • Integrals with variables.
    5·1 answer
  • -4 (2x + 13) + 3x = 80<br> How do you solve this out and get the answer
    15·1 answer
  • What is the place of the 5 in 35.052
    7·1 answer
  • Find the length of CE
    14·1 answer
  • Pls help me on #3. I been having trouble on this I’m not so good at math
    6·1 answer
  • Solve by factoring.<br> f(x) = x^2 + 7x + 12
    10·1 answer
  • The volume of the rectangular pyramid is 120 m^3. The height, h,
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!