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
mylen [45]
3 years ago
5

A rocking horse has a weight limit of 60 pounds.

Mathematics
1 answer:
Naddika [18.5K]3 years ago
5 0
33 divided by 60= 0.55
0.55 x 100= 55

The answer is 55%
You might be interested in
Find the measure of one interior angle of a regular 14-gon.
lozanna [386]

\bf \textit{sum of all interior angles in a polygon}\\\\ n\theta =180(n-2)~~ \begin{cases} n=\stackrel{polygon}{sides}\\ \theta = angle~in\\ \qquad degrees\\[-0.5em] \hrulefill\\ n = 14\\ \end{cases}\implies 14\theta =180(14-2) \\\\\\ 14\theta =180(12)\implies 14\theta =2160\implies \theta =\cfrac{2160}{14}\implies \theta \approx 154.3^o

8 0
3 years ago
64,223=_____=641.23<br>​
FrozenT [24]

Answer: Check

12^10 × 12^(-2) = 12^(10 - 2) = 12^8

________________________________

Second option : ---

3^2 × 4^6 = 3^2 × 4^2 × 4^4 = 12^2 × 4^4

________________________________

Third option : ---

(12^8)^0 = 12^(8 × 0) = 12^0 = 1

________________________________

4th option : Check

12^10 / 12^2 = 12^10 × 12^(-2) = 12^(10 - 2)

= 12^8

________________________________

5th option : Check

2^8 × 6^8 = ( 2 × 6 )^8 = 12^8

Step-by-step explanation:

3 0
2 years 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
3 years ago
I need help please <br>A 21%<br>B 63%<br>C 37%<br>D 70%​
uranmaximum [27]

Answer:

d 70%

Step-by-step explanation:

30 students in class

21 students with 5+ vowels

21/30 x 100 = 70%

7 0
3 years ago
Read 2 more answers
Absolute value of -18.26
Effectus [21]
The absolute value is 18.26
4 0
3 years ago
Other questions:
  • The side of an equilateral triangle is 8 inches shorter than the side of a square. The perimeter of the square is 46 inches more
    5·1 answer
  • 18000lb greater then or less then 9T
    8·2 answers
  • Write a rule for the linear function in the table.
    15·1 answer
  • A circle is shown. Secant R T and tangent U T intersect at point T outside of the circle to form an angle with a measure of 21 d
    7·2 answers
  • 6/24 in its simplest term
    9·2 answers
  • Marge cut 16 pieces of tape for mounting pictures on poster board. Each piece of tape was 3/8 inch long. How much tape did Marge
    13·1 answer
  • You know that a rope is no more than 150 feet long. You need to cut the rope into 3 pieces.
    13·1 answer
  • PLEASE HURRY!!! what is the slope of the graph?
    12·2 answers
  • I GIVE BRAINLIESTY FOR CORRECT
    9·2 answers
  • PLEASE HELP ASAPP!!!! I’LL GIVE BRAINLIEST!! PLEASE HELP QUICKLY!
    8·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!