All categories

3 years ago

Please help, please help

Mathematics

1 answer:

zmey [24]3 years ago

7 0

Answers:
x=22
x+4=26
6x=132

Explanation:
We learned from the question that all of the angles in a triangle add up to 180 degrees.

180=angle+angle+angle

When we plug in the values that the question gives us for the angles, we get this equation:

180=x+6x+(x+4)

After solving this equation, we get 22 as the value of x (The process of solving that equation is in the picture attached).

To solve for (x+4), we plug in the value of x, which is 22 and add 4.

(x+4)
=(22+4)
=26

And finally, to solve for 6x, we plug in 22 again:

6x
=6*22
=132

Hope this helps!

You might be interested in

Using linked lists or a resizing array; develop a weighted quick-union implementation that removes the restriction on needing th

balu736 [363]

Answer:

Step-by-step explanation:

package net.qiguang.algorithms.C1_Fundamentals.S5_CaseStudyUnionFind;

import java.util.Random;

/**

* 1.5.20 Dynamic growth.

* Using linked lists or a resizing array, develop a weighted quick-union implementation that

* removes the restriction on needing the number of objects ahead of time. Add a method newSite()

* to the API, which returns an int identifier

public class Exercise_1_5_20 {

public static class WeightedQuickUnionUF {

private int[] parent; // parent[i] = parent of i

private int[] size; // size[i] = number of sites in subtree rooted at i

private int count; // number of components

int N; // number of items

public WeightedQuickUnionUF() {

N = 0;

count = 0;

parent = new int[4];

size = new int[4];

}

private void resize(int n) {

int[] parentCopy = new int[n];

int[] sizeCopy = new int[n];

for (int i = 0; i < count; i++) {

parentCopy[i] = parent[i];

sizeCopy[i] = size[i];

}

parent = parentCopy;

size = sizeCopy;

}

public int newSite() {

N++;

if (N == parent.length) resize(N * 2);

parent[N - 1] = N - 1;

size[N - 1] = 1;

return N - 1;

}

public int count() {

return count;

}

public int find(int p) {

// Now with path compression

validate(p);

int root = p;

while (root != parent[root]) {

root = parent[root];

}

while (p != root) {

int next = parent[p];

parent[p] = root;

p = next;

}

return p;

}

// validate that p is a valid index

private void validate(int p) {

if (p < 0 || p >= N) {

throw new IndexOutOfBoundsException("index " + p + " is not between 0 and " + (N - 1));

}

public boolean connected(int p, int q) {

return find(p) == find(q);

}

public void union(int p, int q) {

int rootP = find(p);

int rootQ = find(q);

if (rootP == rootQ) {

return;

}

// make smaller root point to larger one

if (size[rootP] < size[rootQ]) {

parent[rootP] = rootQ;

size[rootQ] += size[rootP];

} else {

parent[rootQ] = rootP;

size[rootP] += size[rootQ];

}

count--;

}

public static void main(String[] args) {

WeightedQuickUnionUF uf = new WeightedQuickUnionUF();

Random r = new Random();

for (int i = 0; i < 20; i++) {

System.out.printf("\n%2d", uf.newSite());

int p = r.nextInt(i+1);

int q = r.nextInt(i+1);

if (uf.connected(p, q)) continue;

uf.union(p, q);

System.out.printf("%5d-%d", p, q);

uf.union(r.nextInt(i+1), r.nextInt(i+1));

}

8 0

3 years ago

The drama club spent $450 on tickets and buses for a field trip to the theater. 15 members of the drama club attended the field

guajiro [1.7K]

Answer: 525

Step-by-step explanation:

450+15+60=525

8 0

3 years ago

Read 2 more answers

Order the numbers from least to greatest. -7/5, -1 5/11, -1.45, -1 91/200

Anna35 [415]

Answer:

Step-by-step explanation:

-7/5=-1.400

-1 5/11=-16/11=-1.455...

-1.450

-1 91/200=-291/200=-1.405

-1.455 <-1.450 <-1.405 <-1.400

- 1 5/11 <-1.45 <- 91/200 <-7/5

7 0

3 years ago

Hello I need help with this math it’s negative fractions so -7 1/5 - (-2/5)

jekas [21]

Answer:

-6 4/5

Step-by-step explanation:

4 0

2 years ago

Read 2 more answers

How can I use benchmarks to estimate 9/10+4/10

Jobisdone [24]

I don’t kno how to estimate using benchmarks but I kno the exacts answer is 13/10 or 1.3

4 0

3 years ago