Answer:
The manager should include 7 independent variables in her multiple regression analysis.
Step-by-step explanation:
Lets consider sales revenue to bethe dependent variable and, type of sport, color, and target audience, the categorical variables represented with dummy variables. Just remeber that one fewer dummy variables than the number of options in a category must be used, so, type of sport should be represented by: 3 - 1 = 2 dummy variables
color should be represented by 5 - 1 = 4 dummy variables, and
target audience should be represented by 2 - 1 = 1 dummy variables
This totalizes: 2 + 4 + 1 =7 independent variables.
-4 > -9
-4 is closer to 0 than -9
it is further right on the number line
Hello from MrBillDoesMath!
Answer:
z = 28 (y/x)
Discussion:
"
z varies inversely with x and directly with y" translates into
z = k * (y/x) (*)
Substituting x = 2, y = 3, z = 42 in (*) gives
42 = k (3/2) => multiply both sides by 2/3
42 (2/3) = k (3/2)(2/3) => 42(2/3) = 28; (3/2)(2/3) = 1
28 = k
Conclusion:
z = 28 (y/x)
Thank you,
MrB
Answer:
The gcd(259, 621) = 1 and gcd(108, 156) = 12
Step-by-step explanation:
The Euclidean algorithm solves the problem:
Given integers a, b, find d = gcd(a,b)
These are the steps of the Euclidean algorithm:
- Let a = x, b = y.
- Given x, y use the division algorithm to write
where q is quotient and r is the remainder - If r = 0, stop and output y; this is the gcd of a, b.
- if r ≠ 0, replace (x, y) by (y,r). Go to step 2.
These are the steps for the division algorithm:
- Subtract the divisor from the dividend repeatedly until we get a result that lies between 0 and the divisor
- The resulting number is known as the remainder, and the number of times that the divisor is subtracted is called the quotient.
To find the greatest common divisor of 621 and 259 by the Euclidean algorithm you need to:
- Divide 621 by 259, applying the division algorithm you get
next you need to write the expression 
- Divide 259 by 103 to write

- Divide 103 by 53 to write

- Divide 53 by 50 to write

- Divide 50 by 3 to write

- Divide 3 by 2 to write

- Divide 2 by 1 to write

The greatest common divisor of 621 and 259 is 1
To find the greatest common divisor of 156 and 108 by the Euclidean algorithm you need to:
- Divide 156 by 108 to write

- Divide 108 by 48 to write

- Divide 48 by 12 to write

The greatest common divisor of 156 and 108 is 12
Answer:890.12 cm^3
Step-by-step explanation:
The formula for the volume of a cylinder is

V=628.3185307 cm^3
or simply
V=628.32 cm^3
Since, you know the radius of the hemisphere on top, you also know the radius since the height of the hemisphere is the same as it is wide.
Next, the formula for the volume of a sphere is

so the volume of a hemisphere is half of that or:

V= 261.7993878 cm^3
or simply
V=261.80 cm^3
Finally, you add both of the volumes together to get
V= 890.1179185 cm^3
or simply
V=890.12 cm^3