First, let's find all the factors of 81:
81/3=27
27/3=9
9/3=3
3/1=1
So the factors of 81 are 3,3,3,3, (the numbers by which we divided here).
This means we can write down 81 as 3*3*3*3 or
- which is the answer to the question! (three to the power of 4)
Answer:
Step-by-step explanation:
6) Convert mixed fraction to improper fraction and then plugin the values in the formula.
b) 10 cubic yard is less than 11 2/3 cubic yard. So, it will fit in the wood shed.
7) Right side rectangular prism:
l = 16 in
w = 5 in
h = 20 - 14 = 6 in
Volume 1 = 16 * 5 * 6 = 480 cubic inches
Left side rectangular prism:
l = 9 in
w = 5 in
h =14 in
Volume 2 = 9 * 5 * 14 = 630 cubic in
Volume of composite solid = 480 + 630 = 1110 cubic inches
Answer:
F (53) =
53,316,291,173
To learn more about the Fibonacci Sequence:
https://www.1728.org/fibonacci.htm
Step-by-step explanation:
Answer:
No solution
Step-by-step explanation:
Unfortunately your screenshot has cut off the final answer choice, if it says "no solution" you should choose that because these two lines are parallel. Meaning they will never intersect, and the point of intersection is usually the solution.
Answer:
Part c: Contained within the explanation
Part b: gcd(1200,560)=80
Part a: q=-6 r=1
Step-by-step explanation:
I will start with c and work my way up:
Part c:
Proof:
We want to shoe that bL=a+c for some integer L given:
bM=a for some integer M and bK=c for some integer K.
If a=bM and c=bK,
then a+c=bM+bK.
a+c=bM+bK
a+c=b(M+K) by factoring using distributive property
Now we have what we wanted to prove since integers are closed under addition. M+K is an integer since M and K are integers.
So L=M+K in bL=a+c.
We have shown b|(a+c) given b|a and b|c.
//
Part b:
We are going to use Euclidean's Algorithm.
Start with bigger number and see how much smaller number goes into it:
1200=2(560)+80
560=80(7)
This implies the remainder before the remainder is 0 is the greatest common factor of 1200 and 560. So the greatest common factor of 1200 and 560 is 80.
Part a:
Find q and r such that:
-65=q(11)+r
We want to find q and r such that they satisfy the division algorithm.
r is suppose to be a positive integer less than 11.
So q=-6 gives:
-65=(-6)(11)+r
-65=-66+r
So r=1 since r=-65+66.
So q=-6 while r=1.
