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
Lady bird [3.3K]
3 years ago
12

Plzzzz help :( will make u brainlist :) /math/

Mathematics
2 answers:
ella [17]3 years ago
6 0
60 cm hopefully it will be correct
irga5000 [103]3 years ago
3 0

Answer: 60 cm

Step-by-step explanation:

multiply sides together.

You might be interested in
If the discriminate of a quadratic equation is 28 describe the roots
katrin2010 [14]
B) two real roots is the answer because it is bigger than 0.
7 0
3 years ago
Can someone help me on this
fiasKO [112]

I know that i had it on a test its -2.11 Hope you ace it!

7 0
3 years ago
Read 2 more answers
The sum of two numbers is 17. Their difference is 3. Find the numbers.
Afina-wow [57]

Answer: 7 & 10

Step-by-step explanation:

7+10=17

10-7=3

8 0
2 years ago
Read 2 more answers
The sum of three numbers is 244.84. One of the numbers is 24.6. The other two numbers are equal to each other. What is the value
mamaluj [8]

Answer:

The value of each of the other two numbers is 110.12

Step-by-step explanation:

244.84 - 24.6 = 220.24

220.24 divided by half is 110.12

The value of the other two numbers is 110.12

4 0
1 year ago
What is the smallest integer $n$, greater than $1$, such that $n^{-1}\pmod{130}$ and $n^{-1}\pmod{231}$ are both defined?
olasank [31]

First of all, the modular inverse of n modulo k can only exist if GCD(n, k) = 1.

We have

130 = 2 • 5 • 13

231 = 3 • 7 • 11

so n must be free of 2, 3, 5, 7, 11, and 13, which are the first six primes. It follows that n = 17 must the least integer that satisfies the conditions.

To verify the claim, we try to solve the system of congruences

\begin{cases} 17x \equiv 1 \pmod{130} \\ 17y \equiv 1 \pmod{231} \end{cases}

Use the Euclidean algorithm to express 1 as a linear combination of 130 and 17:

130 = 7 • 17 + 11

17 = 1 • 11 + 6

11 = 1 • 6 + 5

6 = 1 • 5 + 1

⇒   1 = 23 • 17 - 3 • 130

Then

23 • 17 - 3 • 130 ≡ 23 • 17 ≡ 1 (mod 130)

so that x = 23.

Repeat for 231 and 17:

231 = 13 • 17 + 10

17 = 1 • 10 + 7

10 = 1 • 7 + 3

7 = 2 • 3 + 1

⇒   1 = 68 • 17 - 5 • 231

Then

68 • 17 - 5 • 231 ≡ = 68 • 17 ≡ 1 (mod 231)

so that y = 68.

3 0
2 years ago
Other questions:
  • I need help <br><br> Circle P is below
    7·2 answers
  • What is the value expression (9+15) divide by 3 +2<br> help me pleaseee!!!
    10·1 answer
  • On-the-Go Phone Company has two monthly plans for their customers.The EZ Pay Plan costs $0.15 per minute. The 40 to Go Plan cost
    8·2 answers
  • A cruise ship can cover 21 nautical miles in 483 minutes. How many nautical miles will it travel in 230 minutes?
    7·2 answers
  • Given the function f(x)=x^2-8x+13f(x)=x, determine the average rate of change of the function over the interval −1≤x≤6.
    5·1 answer
  • Look at the pentagonal numbers. Use finite differences to determine which function represents the pattern.
    13·2 answers
  • Help please if you can
    9·1 answer
  • Which two ratios form a proportion?
    5·1 answer
  • Find the y-intercept of the line: 6x – 3y +6=0
    11·1 answer
  • Which of the following is a Recursive Formula for an Arithmetic Sequence?
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!