Answer:
option A
Step-by-step explanation:

Answer:
$35
Step-by-step explanation:
175/5 = 35
have a nice day! (maybe get this double checked in case I did it wrong :D)
25/100=30/x x=120 (30+70y)/(120+100y)=50/100 100y=?
Answer:

Step-by-step explanation:
Considering the equation

Solving


As





![=\left(x+1\right)\frac{x^4+8x^3+8x^2+8x+7}{x+1}...[A]](https://tex.z-dn.net/?f=%3D%5Cleft%28x%2B1%5Cright%29%5Cfrac%7Bx%5E4%2B8x%5E3%2B8x%5E2%2B8x%2B7%7D%7Bx%2B1%7D...%5BA%5D)
Solving


Putting
=
in equation [A]
So,
![\left(x+1\right)\frac{x^4+8x^3+8x^2+8x+7}{x+1}...[A]](https://tex.z-dn.net/?f=%5Cleft%28x%2B1%5Cright%29%5Cfrac%7Bx%5E4%2B8x%5E3%2B8x%5E2%2B8x%2B7%7D%7Bx%2B1%7D...%5BA%5D)

As

So,
Equation [A] becomes

So, the polynomial equation becomes







Keywords: polynomial equation
Learn polynomial equation from brainly.com/question/12240569
#learnwithBrainly
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.