A^5·a^4/ a^2 A) a^11 B) a^18 C) a^7 D) a^8

Ip a solid sphere with a diameter of 0.19 m is released from rest; it then rolls without slipping down a ramp, dropping through

lubasha [3.4K]

Answer: K = (1/2) mvÂ˛ + (1/2) IĎ‰Â˛, where m is the ball mass, I is the ball's moment of inertia (2/5)mrÂ˛, and Ď‰ is the angular velocity of the ball. Because the ball rolls without slipping, it is easy to see that v=Ď‰r, or r=v/Ď‰. Then, K = (1/2)mvÂ˛ + (1/2)(2/5)mrÂ˛Ď‰Â˛ = (1/2)mvÂ˛ + (1/5)mvÂ˛ = (7/10)mvÂ˛ Setting potential at the top equal to kinetic at the bottom, mgh=(7/10)mvÂ˛ v=âš{(10/7)(gh)} = [(10/7)(9.8)(0.51)]^(1/2) = 2.672m/s

5 0

3 years ago

What is the inverse function f(x)=-3x-2

vesna_86 [32]

f^-1 (x) = 2/3 + x/3

6 0

3 years ago

Use the Euclidean Algorithm to compute the greatest common divisors indicated. (a) gcd(20, 12) (b) gcd(100, 36) (c) gcd(207, 496

coldgirl [10]

Answer:

(a) $gcd(20, 12)=4$

(b) $gcd(100, 36)=4$

(c) $gcd(496,207 )=1$

Step-by-step explanation:

The Euclidean algorithm is an efficient method for computing the greatest common divisor of two integers, without explicitly factoring the two integers.

The Euclidean algorithm solves the problem:

Given integers $a, b$ , find $d=gcd(a,b)$

Here is an outline of the steps:

Let $a=x$ , $b=y$ .
Given $x, y$ , use the division algorithm to write $x=yq+r$ .
If $r=0$ , stop and output $y$ ; this is the gcd of $a, b$ .
If $r\neq 0$ , replace $(x,y)$ by $(y,r)$ . Go to step 2.

The division algorithm is an algorithm in which given 2 integers N and D, it computes their quotient Q and remainder R.

Let's say we have to divide N (dividend) by D (divisor). We will take the following steps:

Step 1: Subtract D from N repeatedly.

Step 2: The resulting number is known as the remainder R, and the number of times that D is subtracted is called the quotient Q.

(a) To find $gcd(20, 12)$ we apply the Euclidean algorithm:

$20 = 12\cdot 1 + 8\\ 12 = 8\cdot 1 + 4\\ 8 = 4\cdot 2 + 0$

The process stops since we reached 0, and we obtain $gcd(20, 12)=4$ .

(b) To find $gcd(100, 36)$ we apply the Euclidean algorithm:

$100 = 36\cdot 2 + 28\\ 36 = 28\cdot1 + 8\\ 28 = 8\cdot 3 + 4\\ 8 = 4\cdot 2 + 0$

The process stops since we reached 0, and we obtain $gcd(100, 36)=4$ .

(c) To find $gcd(496,207 )$ we apply the Euclidean algorithm:

$496 = 207\cdot 2 + 82\\ 207 = 82\cdot 2 + 43\\ 82 = 43\cdot 1 + 39\\ 43 = 39\cdot 1 + 4\\ 39 = 4\cdot 9 + 3\\ 4 = 3\cdot 1 + 1\\ 3 = 1\cdot 3 + 0$

The process stops since we reached 0, and we obtain $gcd(496,207 )=1$ .

3 0

3 years ago

What is the area of the square? A square with the left side labeled 4 units.

Liono4ka [1.6K]

Area of square is a^2
4^2 = 16
the area is 16 units

7 0

2 years ago

Read 2 more answers

1+secA/sec A = sin^2 A / 1-cos A

Fofino [41]

Answer: see proof below

Step-by-step explanation:

$\dfrac{1+\sec A}{\sec A}=\dfrac{\sin^2 A}{1-\cos A}$

Use the following Identities:

sec Ф = 1/cos Ф

cos² Ф + sin² Ф = 1

Proof LHS → RHS

$\text{LHS:}\qquad \qquad \dfrac{1+\sec A}{\sec A}$

$\text{Identity:}\qquad \qquad \dfrac{1+\frac{1}{\cos A}}{\frac{1}{\cos A}}$

$\text{Simplify:}\qquad \qquad \dfrac{\frac{\cos A+1}{\cos A}}{\frac{1}{\cos A}}\\\\\\.\qquad \qquad \qquad =\dfrac{1+\cos A}{1}$

$\text{Multiply:}\qquad \qquad \dfrac{1+\cos A}{1}\cdot \bigg(\dfrac{1-\cos A}{1-\cos A}\bigg)\\\\\\.\qquad \qquad \qquad =\dfrac{1-\cos^2 A}{1-\cos A}$

$\text{Identity:}\qquad \qquad \dfrac{\sin^2 A}{1-\cos A}$

$\text{LHS = RHS:}\quad \dfrac{\sin^2 A}{1-\cos A}=\dfrac{\sin^2 A}{1-\cos A}\quad \checkmark$

3 0

3 years ago