NEED TO SUBMIT NOW PLS HELPPP

The minute hand on a watch is 2.00 cm in length. what is the displacement vector of the tip of the minute hand

olchik [2.2K]

The displacement vector is a vector which gives the point's current position with reference to other points apart from points from the origin. The given length here of the minute hand is the radius and the distance can be written as,
r∠θ
which means that the position can be described by the θ.

3 0

3 years ago

Randy, Sandy and Todd are my cousins and their combined age is 87 years. Randy is four times as old as Sandy, but Todd is actual

NISA [10]

Answer:

Randy is 48 years old

Sandy is 12 years old

Todd is 27 years old

Step-by-step explanation:

Given

Represent their ages with the first letters of their names:

$R + S + T = 87$

$R = 4 * S$

$T = 15 + S$

Required

Determine their individual ages

We'll solve the above equations using substitution method of simultaneous equations

Substitute 15 + S for T and 4 * S for R in $R + S + T = 87$

This gives:

$4 * S + S + 15 + S = 87$

$4 S + S + 15 + S = 87$

Collect Like Terms

$4 S + S + S = 87 - 15$

$6S = 72$

Divide through by 6

$S = 72/6$

$S = 12$

This implies that Sandy is 12 years old

Substitute 12 for S in $R = 4 * S$ and $T = 15 + S$

$R = 4 * 12$

$R = 48$

$T = 15 + 12$

$T = 27$

This implies that Randy is 48 years old and Todd is 27

7 0

3 years ago

2/5 × 1/6 , but the answer as a fraction 11 points

dusya [7]

Answer:

1/15

Step-by-step explanation:

2/5*1/6

Make the denominator the same

12/30*5/30

2/30

Simplify

1/15

6 0

2 years ago

Read 2 more answers

For integers a, b, and c, consider the linear Diophantine equation ax C by D c: Suppose integers x0 and y0 satisfy the equation;

Dmitrij [34]

Answer:

a.

$x = x_1+r(\frac{b}{gcd(a, b)} )\\y=y_1-r(\frac{a}{gcd(a, b)} )$

b. x = -8 and y = 4

Step-by-step explanation:

This question is incomplete. I will type the complete question below before giving my solution.

For integers a, b, c, consider the linear Diophantine equation

$ax+by=c$

Suppose integers x0 and yo satisfy the equation; that is,

$ax_0+by_0 = c$

what other values

$x = x_0+h$ and $y=y_0+k$

also satisfy ax + by = c? Formulate a conjecture that answers this question.

Devise some numerical examples to ground your exploration. For example, 6(-3) + 15*2 = 12.

Can you find other integers x and y such that 6x + 15y = 12?

How many other pairs of integers x and y can you find ?

Can you find infinitely many other solutions?

From the Extended Euclidean Algorithm, given any integers a and b, integers s and t can be found such that

$as+bt=gcd(a,b)$

the numbers s and t are not unique, but you only need one pair. Once s and t are found, since we are assuming that gcd(a,b) divides c, there exists an integer k such that gcd(a,b)k = c.

Multiplying as + bt = gcd(a,b) through by k you get

$a(sk) + b(tk) = gcd(a,b)k = c$

So this gives one solution, with x = sk and y = tk.

Now assuming that ax1 + by1 = c is a solution, and ax + by = c is some other solution. Taking the difference between the two, we get

$a(x_1-x) + b(y_1-y)=0$

Therefore,

$a(x_1-x) = b(y-y_1)$

This means that a divides b(y−y1), and therefore a/gcd(a,b) divides y−y1. Hence,

$y = y_1+r(\frac{a}{gcd(a, b)})$ for some integer r. Substituting into the equation

$a(x_1-x)=rb(\frac{a}{gcd(a, b)} )\\gcd(a, b)*a(x_1-x)=rba$

or

$x = x_1-r(\frac{b}{gcd(a, b)} )$

Thus if ax1 + by1 = c is any solution, then all solutions are of the form

$x = x_1+r(\frac{b}{gcd(a, b)} )\\y=y_1-r(\frac{a}{gcd(a, b)} )$

In order to find all integer solutions to 6x + 15y = 12

we first use the Euclidean algorithm to find gcd(15,6); the parenthetical equation is how we will use this equality after we complete the computation.

$15 = 6*2+3\\6=3*2+0$