Answer:
n = 32
Step-by-step explanation:
<u><em>Given:</em></u>
<u><em></em></u>
<u><em>Solve:</em></u>
<em />
<em />
~![\mathrm{[Kavinsky]}](https://tex.z-dn.net/?f=%5Cmathrm%7B%5BKavinsky%5D%7D)
Answer:
The graph would be a line starting at one and moving to the left infinitely. The dot would be closed.
Answer:
3×5×53
Step-by-step explanation:
You can use divisibility rules to find the small prime factors.
The number ends in 5, so is divisible by 5.
795/5 = 159
The sum of digits is 1+5+9 = 15; 1+5 = 6, a number divisible by 3, so 3 is a factor.
159/3 = 53 . . . . . a prime number,* so we're done.
795 = 3×5×53
_____
* If this were not prime, it would be divisible by a prime less than its square root. √53 ≈ 7.3. We know it is not divisible by 2, 3, or 5. We also know the closest multiples of 7 are 49 and 56, so it is not divisible by 7. Hence 53 is prime.
Answer:
Sure what do you need?
Step-by-step explanation:
