Consider the triangles.

Did I do it rightly?

Andreas93 [3]

Yes. If the segment only has 2 points, it can be named both ways.

3 0

3 years ago

Let F be a field, and suppose a EF, a *0. Prove that a has a unique multiplicative inverse.

bezimeni [28]

Answer with Step-by-step explanation:

Let F be a field .Suppose $a\in F$ and $a\neq 0$

We have to prove that a has unique multiplicative inverse.

Suppose a has two inverses b and c

Then, $ac=1,ab=1$ where 1 =Multiplicative identity

$ac=ab$

$c=b$ (cancel a on both sides)

Hence, a has unique multiplicative inverse.

6 0

4 years ago

3. Which expression is equivalent to 1+2(x-1)

padilas [110]

Answer:

2x - 1

Step-by-step explanation:

Equivalent Algebraic Expressions

One algebraic expression can be written in several ways by applying known rules and theorems that modify expressions without changing its final value.

The expression:

1 + 2(x - 1)

Can be modified by applying the following operations:

Multiplying the constant by the contents in parentheses:

1 + 2x - 2

Collecting like terms:

-1 + 2x

Or, equivalently:

2x - 1

8 0

3 years ago

Which classification best represents a triangle with side lengths 6 cm, 10 cm, and 12 cm?

DedPeter [7]

Answer:

obtuse because 62 + 102 < 122

S

3 0

2 years ago

Read 2 more answers

5. The recursive algorithm given below can be used to compute gcd(a, b) where a and b are non-negative integer, not both zero.

s2008m [1.1K]

Implementating the given algorithm in python 3, the greatest common divisors of (124 and 244) and (4424 and 2111) are 4 and 1 respectively.

The program implementation is given below and the output of the sample run is attached.

def gcd(a, b):

#initialize a function named gcd which takes in two parameters

if a>b:

#checks if a is greater than b

return gcd (b, a)

#if true interchange the Parameters and Recall the function

elif a == 0:

return b

elif a == 1:

return 1

elif((a%2 == 0)and(b%2==0)):

#even numbers leave no remainder when divided by 2, checks if a and b are even

return 2 * gcd(a/2, b/2)

elif((a%2 !=0) and (b%2==0)):

#checks if a is odd and B is even

return gcd(a, b/2)

else :

return gcd(a, b-a)

#since it's a recursive function, it recalls the function with new parameters until a certain condition is satisfied

print(gcd(124, 244))

print()

#leaves a space after the first output

print(gcd(4424, 2111))

Learn more :brainly.com/question/25506437

6 0

3 years ago