All categories

3 years ago

Somebody please help me fast

Mathematics

1 answer:

nydimaria [60]3 years ago

8 0

Use the equation

-2 - 5 = -7
0 - -3 = 3

-4 - 1 = -5
0 - 5 = - 5

this is all i am going to tell you

think you can figure the rest out on your own

Hope i helped mate!

You might be interested in

Elapsed time 2 hr 37 min, end time: 1:15. start time?

3241004551 [841]

Answer:

10:38

Step-by-step explanation:

2 hours back from 1:15

11:15

37 minutes back from 11:15

10:38

The start time is 10:38.

6 0

3 years ago

Read 2 more answers

Write an equation of the perpendicular bisector of the segment with end points M(1,5) and N(7,-1)

vitfil [10]

The perpendicular bisector of the segment passes through the midpoint of this segment. Thus, we will initially find the midpoint P:

$P=\dfrac{(1,5)+(7,-1)}{2}=\dfrac{(8,4)}{2}=(4,2)$

Now, we will calculate the slope of the segment support line (r). After this, we will use the fact that the perpendicular bisector (p) is perpendicular to r:

$m_r=\dfrac{\Delta y}{\Delta x}=\dfrac{5-(-1)}{1-7}=\dfrac{6}{-6}\iff m_r=-1$

$p\perp r\Longrightarrow m_p\cdot m_r=-1\Longrightarrow m_p\cdot(-1)=-1\iff m_p=1$

We can calculate the equation of p by using its slope and its point P:

$y-y_P=m_p(x-x_P)\\\\
y-2=1\cdot(x-4)\\\\
y-2=x-4\\\\
\boxed{p:~~y=x-2}$

4 0

3 years ago

Prove that u(n) is a group under the operation of multiplication modulo n.

katrin2010 [14]

Answer:

The answer is the proof so it is long.

The question doesn't define u(n), but it's not hard to guess.

Group G with operation ∘

For all a and b and c in G:

1) identity: e ∈ G, e∘a = a∘e = a,

2) inverse: a' ∈ G, a∘a' = a'∘a = e,

3) closed: a∘b ∈ G,

4) associative: (a∘b)∘c = a∘(b∘c),

5) (optional) commutative: a∘b = b∘a.

Define group u(n) for n prime is the set of integers 0 < i < n with operation multiplication modulo n.

If n isn't prime, we exclude from the group all integers which share factors with n.

Identity: e = 1. Clearly 1∘a = a∘1 = a. (a is already < n).

Closed: u(n) is closed for n prime. We must show that for all a, b ∈ u(n), the integer product ab is not divisible by n, so that ab ≢ 0 (mod n). Since n is prime, ab ≠ n. Since a < n, b < n, no factors of ab can equal prime n. (If n isn't prime, we already excluded from u(n) all integers sharing factors with n).

Inverse: for all a ∈ u(n), there is a' ∈ u(n) with a∘a' = 1. To find a', we apply Euclid's algorithm and write 1 as a linear combination of n and a. The coefficient of a is a' < n.

Associative and Commutative:

(a∘b)∘c = a∘(b∘c) because (ab)c = a(bc)

a∘b = b∘a because ab = ba.

5 0

3 years ago

Read 2 more answers

The table shows one point from the given graph. How could you find more ordered pairs to create a graph and table of equivalent

11Alexandr11 [23.1K]

Answer:

A,B,D

Step-by-step explanation:

JUST TOOK THE QUIZ