fill in the blanks to make the statements true.65 ÷ ( – 13) =\_\_\_\_\_\_\_\_
**Fill in the blanks to make the statements true.**

65 ÷ ( – 13) =\_\_\_\_\_\_\_\_
65 ÷ ( – 13) = **-5**
if a number is divisible by 55 than it must alsobe divisible by factors of 55 that is 5 and 11.∵ aabb is divisible by 5∴ by divisibility test of 5 b must be 0 or 5.therefore (c) option is correct. Definition used:  

Congruence.  

Let m be an integer greater than 1. If xand yare integers, then x is congruent to y modulo m if x — y is divisible by m. It can be represented as \(\displaystyle{x}={y}{\left({b}\ mod\ {m}\right)}\). This relation is called as congruence modulo m.  

Calculation:   

Consider the values and congruence classes modulo m,  

\(\displaystyle{\left[{13}\right]}^{{{6}}}\) and m = 15.  

It is evident that [x]=[y] if \(\displaystyle{\left[{x}={y}{\left({b}\ mod\ {m}\right)}\right]}\). Since \(\displaystyle{13}=-{2}{\left({b} \ mod \ {15}\right)}\).  

Then,  

[13]=[-2]  

\(\displaystyle{\left[{13}\right]}^{{{6}}}={\left[-{2}\right]}^{{{6}}}\)  

\(\displaystyle={\left[{\left(-{2}\right)}^{{{6}}}\right]}\)  

=[64]  

Since, by the principal or congruence \(\displaystyle{64}={4}{\left({b}\ mod \ {15}\right)}\). Therefore, \(\displaystyle{\left[{13}\right]}^{{{6}}}={\left[{4}\right]}\) in \(\displaystyle{Z}\_{{{15}}}\).  

Therefore, the value of the expression is [4]. finding the correct answer here is important, but perhaps equally important is finding it using the method of matrix reduction, since those are the instructions.the augmented matrix is4 -2 -5 -514 -1 -2 -364 -2 4 -24you'll have to forgive the poor formatting. this answer box doesn't have a proper math symbol editor.using elementary row operations, the reduced row echelon form of the augmented matrix is1 0 0 -60 1 0 60 0 1 3from which we conclude that the system has a unique solution (-6,6,3). to find: limitsnote: first check the form of imit. used this method if the limit is satisfying any one from 7 indeterminate form.in this case, indeterminate form is formula used: = 1so, by using the above formula, we have = = therefore, = let x denote the number of sixes. p(getting a six when a die is thrown) = p = `(1)/(6)` ∴ q = 1 – p = `1 - (1)/(6) = (5)/(6)` given, n = 6∴ x ∼ b`(6, 1/6)`the p.m.f. of x is given by p(x = x) = `""^6"c"\_x (1/6)^x (5/6)^(6 - x), x` = 0, 1,...,6p(getting at most 2 sixes) = p(x ≤ 2) = p(x = 0 or x = 1 or x = 2) = p(x = 0) + p(x = 1) + p(x = 2) = `""^6"c"\_0(1/6)^0 (5/6)^6 + ""^6"c"\_1(1/6)(5/6)5 + ""^6"c"\_2(1/6)^2 (5/4)^4` = `(5/6)^4 + 6(1/6)(5/6)^5 + (6!)/(2! xx 4!)(1/6)^2 (5/6)^4` = `(5/6)^4 [(5/6)^2 + (5/6) + (6 xx 5 xx 4!)/(2 xx 1 xx 4) xx (1/6)^2]` = `(5/6)^4 [25/6^2 + 30/6^ + 15/6^2]` = `(5/6)^4 (70/36)` = `(5/6)^4 (35/18)` = `(5/4)^4 ((5 xx 7)/(6 xx 3))` = `(7)/(3)(5/6)^5`. you are correct.there is a simple mathematical reason why your answer is correct, but wyzant told me that adding it to this answer required review by wyzant.try again:p(a or b) = p(a) + p(b) - p(a and b)p(neither a nor b) = 1 - p(a or b) `for i in count:` means `for i in 7:`, which won't work. The bit after the `in` should be of an iterable type, not a number. Try this:



```
for i in range(count):

``` f(x) = u/v....i.e. u = 5x² + 4x + 3 and v = 2x² - 2x - 14

now, f '(x) = (u'v - uv')/v²

so, f '(x) = [(10x + 4)(2x² - 2x - 14) - (5x² + 4x + 3)(4x - 2)]/(2x² - 2x - 14)²   

a bit of tidying up with the denominator gives:

f '(x) = -2[9x² + 76x + 25]/(2x² - 2x - 14)²

:)> i = ke/r
30 = 120k/16
k=4
now you can answer the question when you have fixed the typos. in the given expressionwe know that(a + b)2 = a2 + 2ab + b2(a-b)2 = a2-2ab + b2hence4[a2 + 2ab + b2] – 9[a2-2ab + b2]4a2 + 8ab + 4b2 - 9a2 + 18ab - 9b226ab – 5a2 - 5b225ab + ab – 5a2 – 5b2[25ab – 5a2] + [ab – 5b2]5a[5b – a] – b[5b – a][5a – b][5b – a]hence the factors 4 (a + b)2 – 9 (a – b)2 are [5a – b] and [5b – a]