The answer to the question is 9/45, 8/40
For
![|5x|](https://tex.z-dn.net/?f=%7C5x%7C%3C1)
, we have
![\dfrac1{1-5x}=\displaystyle\sum_{n\ge0}(5x)^n](https://tex.z-dn.net/?f=%5Cdfrac1%7B1-5x%7D%3D%5Cdisplaystyle%5Csum_%7Bn%5Cge0%7D%285x%29%5En)
and so
![g(x)=\dfrac{15}{1-5x}=15\displaystyle\sum_{n\ge0}(5x)^n=3\sum_{n\ge0}5^{n+1}x^n](https://tex.z-dn.net/?f=g%28x%29%3D%5Cdfrac%7B15%7D%7B1-5x%7D%3D15%5Cdisplaystyle%5Csum_%7Bn%5Cge0%7D%285x%29%5En%3D3%5Csum_%7Bn%5Cge0%7D5%5E%7Bn%2B1%7Dx%5En)
which is, again, only valid for
![|5x|](https://tex.z-dn.net/?f=%7C5x%7C%3C1)
.
Answer:
![r=64](https://tex.z-dn.net/?f=r%3D64)
Step-by-step explanation:
First, let's start with what we have. If we use
here's what we can put in:
![y=-4x+b](https://tex.z-dn.net/?f=y%3D-4x%2Bb)
Then we can use one of the given points to find the y-intercept. Since the only complete one is (12,10), we'll use that.
![10=-4(12)+b\\10=-48+b\\58=b](https://tex.z-dn.net/?f=10%3D-4%2812%29%2Bb%5C%5C10%3D-48%2Bb%5C%5C58%3Db)
So now we have
.
Now we can use our other point with the missing y-value and solve for y.
![r=-4(-2)+58\\r=64](https://tex.z-dn.net/?f=r%3D-4%28-2%29%2B58%5C%5Cr%3D64)
So the missing value is 64.
Hope this helps!
Answer:
Step-by-step explanation:
Prime factorization requires dividing by primes starting with smallest prime number
402/2=201
201/3=67, 67 is prime so we cannot go further so the prime factorization of 402 is
2X3X67