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
raketka [301]
3 years ago
9

Can anyone help with this?

Mathematics
1 answer:
slavikrds [6]3 years ago
4 0

Answer:

answer for 1 is 25437.5

Step-by-step explanation:

answer for 2 is 10175

You might be interested in
Graph the line with a slope of −1 that contains the point (3,6)?
azamat

Answer:

y=-x+9

Step-by-step explanation:

The answer above is written in slope-intercept form because it is the easiest form to graph (in my opinion); slope-intercept form is y=mx+b, where m is slope and b is the y-intercept. However, to get the answer, you must first use slope-point. Slope-point is y-y_{1}=m(x-x_{1}). So, plug in the point and slope into the formula. This gives the equation, y-6=-1(x-3). Then, solve the equation for the answer of y=-x+9.

On a graph, the y-intercept will be 9. So, the line will cross the y-axis at a value of 9. Additionally, the slope is -1. So, y will increase by one and x will decrease by one. This means that the line will look like it decrease left to right.

5 0
2 years ago
Find the solution of the given system of equations
nignag [31]

Answer:

Point form-

(3,-2)

Equation Form:

x=3, y=-2

Step-by-step explanation:

Solve for the first variable in one of the equations, then substitute the result into the other equation.

Tip: you can use M athway and S ymbolab to help you :)

*easy way to get answers fast

also follow me >>> anni._.perdue

thnxs

mark me brainliest plzz

4 0
3 years ago
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
Please I need help!!!
Valentin [98]

Answer:

Solution given:

for second

we have

f(x)=x²-9x-36

let

y=x²-9x-36

when

x=0

y=-36

when

y=0

0=x²-9x-36

x²-12x+3x-36=0

x(x-12)+3(x-12)=0

(x-12)(x+3)=0

either

x=12

x=-3

So,

x and y intercepts are (-3,0)(12,0) and 0,-36)

7 0
3 years ago
Hailey went to the market and bought 5 pounds of coffee that costs $2 a pound. She also purchased 2/3 pounds of lunch meat that
Firdavs [7]

Answer:

$16

Step-by-step explanation:

$2 x 5 = $10

1 pound = $9

2/3 = $6

10+6=16

6 0
3 years ago
Other questions:
  • The given figure shows a circle with centre at o and angel AOB=90degree. If the radius the circle is 40c.m and pie=3.14; calcula
    11·1 answer
  • (1/4) to the -4 power
    11·1 answer
  • Inclusive of a 6.8% sales tax, a diamond ring sold for $2029.20. Find the price of the ring before before the tax was added. Rou
    12·1 answer
  • The opera house sells an average of 1700 tickets per night when the price of each ticket is 25$ an employee of the opera house n
    13·1 answer
  • without actually subtracting, how can you tell whether the result of subtracting two numbers will be negative?
    13·2 answers
  • Find an equation of the line described below. Write the equation in slope-intercept form (solved for y), if possible. Slope: und
    5·1 answer
  • An animal shelter has three kinds of Labrador Retrievers: yellow, brown, and black. They have
    9·1 answer
  • (click photo) i’ve posted this 3 times and no ones helped me :((( PLEASE help me with 3-8. i’d really appreciate it. i’m the wor
    11·1 answer
  • You are draining your fish
    12·2 answers
  • (I’ll give points + brainalist for the correct answer)
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!