simplify: (-100)+(-99)+(-98)\_+98+99+100 - maths - integers
simplify:
(-100)+(-99)+(-98)\_+98+99+100
dear student,
![](https://s3mn%20mnimgs%20com/img/shared/content_ck_images/ck_5aa26a6d93cc4%20jpg)
regards
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). hint: first of all, multiply and divide 9 in both the series after taking common 5 and 0.6 from them respectively. then make a g.p of the form \[10,{{10}^{2}},{{10}^{3}}....\] by writing 9 = 10 – 1, 99 = 100 – 1, and so on. finally, use the formula for the sum of n terms of g.p that is \[\dfrac{a\left( 1-{{r}^{n}} \right)}{\left( 1-r \right)}\].complete step-by-step solution -in this question, we have to find the sum of the n terms of the series.(i) 5 + 55 + 555 + ….(ii) .6 + .66 + .666 + ….let us consider the first seriess = 5 + 55 + 555 + ….. n termsby taking out 5 common from the above series, we get, s = 5 (1 + 11 + 111 + 1111 …. n terms)by multiplying 9 on both the sides of the above equation, we get, 9s = 5 [9 + 99 + 999 …… n times]\[\dfrac{9s}{5}=9+99+999.....\text{ n times}\]we can also write the above equation as, \[\dfrac{9s}{5}=\left( 10-1 \right)+\left( 100-1 \right)+\left( 1000-1 \right)....\text{ n times}\]by simplifying the above equation and taking the term 1 separately, we get, \[\dfrac{9s}{5}=\left( {{10}^{1}}+{{10}^{2}}+{{10}^{3}}.....\text{ n times} \right)-\left( 1+1+1......\text{ n times} \right)\]we know that 1 added n times is equal to n and the nth term of 1, 2, 3…. n. so, we get, \[\dfrac{9s}{5}=\left( {{10}^{1}}+{{10}^{2}}+{{10}^{3}}{{....10}^{n}} \right)-\left( n \right)\]we know that the series of the form \[a,ar,a{{r}^{2}},a{{r}^{3}}.....a{{r}^{n}}\] is in g.p and sum of the n terms of this g.p is given by \[\dfrac{a\left( 1-{{r}^{n}} \right)}{\left( 1-r \right)}\]in the above equation, we can see that \[10,{{10}^{2}},{{10}^{3}}....\] are in g.p with the first term and common ratio as 10. so, we get, \[\dfrac{9s}{5}=\dfrac{10\left( 1-{{\left( 10 \right)}^{n}} \right)}{1-10}-n\]\[\dfrac{9s}{5}=\dfrac{10\left( 1-{{\left( 10 \right)}^{n}} \right)}{-9}-n\]\[\dfrac{9s}{5}=\dfrac{10}{9}\left( {{10}^{n}}-1 \right)-n\]\[\dfrac{9s}{5}=\dfrac{10\left( {{10}^{n}}-1 \right)-9n}{9}\]by multiplying \[\dfrac{5}{9}\] on both the sides of the above equation, we get, \[s=\dfrac{5}{9}\left[ \dfrac{10\left( {{10}^{n}}-1 \right)-9n}{9} \right]\]\[s=\dfrac{50\left( {{10}^{n}}-1 \right)}{81}-\dfrac{5}{9}n\]hence, the sum of the sequence 5 + 55 + 555….. up to n terms is equal to \[\dfrac{50\left( {{10}^{n}}-1 \right)}{81}-\dfrac{5n}{9}\]let us consider the second set.s = 0.6 + 0.66 + 0.666 + ….. n times.by taking out 0.6 common, we can write the sequence as, s = 6 [0.1 + 0.11 + 0.111 ….. n terms]by multiplying and dividing rhs by 9, we get,\[s=\dfrac{6}{9}\left[ 0.9+0.99+0.999.....n\text{ terms} \right]\]\[s=\dfrac{2}{3}\left[ \dfrac{9}{10}+\dfrac{99}{100}+\dfrac{999}{1000}+\dfrac{9999}{10000}.....n\text{ terms} \right]\]we can write the above equation as, \[s=\dfrac{2}{3}\left[ \dfrac{\left( 10-1 \right)}{10}+\dfrac{\left( 100-1 \right)}{100}+\dfrac{\left( 1000-1 \right)}{1000}+\dfrac{\left( 10000-1 \right)}{10000}.....n\text{ terms} \right]\]\[s=\dfrac{2}{3}\left[ \left( 1-\dfrac{1}{10} \right)+\left( 1-\dfrac{1}{100} \right)+\left( 1-\dfrac{1}{1000} \right)+\left( 1-\dfrac{1}{10000} \right).....n\text{ terms} \right]\]\[s=\dfrac{2}{3}\left[ \left( 1+1+1......n\text{ terms} \right)-\left( \dfrac{1}{10}+\dfrac{1}{100}+\dfrac{1}{1000}.+...n\text{ terms} \right) \right]\]here, we can see that \[\dfrac{1}{10}+\dfrac{1}{{{\left( 10 \right)}^{2}}}+\dfrac{1}{{{\left( 10 \right)}^{3}}}+.....n\text{ terms}\] is in gp with \[a=\dfrac{1}{10}\] and \[r=\dfrac{1}{10}\].we know that the sum of n terms of the g.p is \[\dfrac{a\left( 1-{{r}^{n}} \right)}{\left( 1-r \right)}\]. so, we get, \[s=\dfrac{2}{3}\left[ \left( n \right)-\dfrac{\dfrac{1}{10}\left( 1-{{\left( \dfrac{1}{10} \right)}^{n}} \right)}{1-\dfrac{1}{10}} \right]\]\[s=\dfrac{2}{3}\left[ n-\dfrac{\dfrac{1}{10}\left( 1-\dfrac{1}{{{10}^{n}}} \right)}{\dfrac{9}{10}} \right]\]\[s=\dfrac{2}{3}\left[ n-\dfrac{1}{9}\left( 1-\dfrac{1}{{{10}^{n}}} \right) \right]\]we know that \[\dfrac{1}{{{a}^{n}}}={{a}^{-n}}\]. by using this, we get, \[s=\dfrac{2}{3}\left( n-\dfrac{1}{9}\left( 1-{{10}^{-n}} \right) \right)\]so, \[s=\dfrac{2}{3}n-\dfrac{2}{27}\left[ 1-{{\left( 10 \right)}^{-n}} \right]\]hence, we get the sum of the sequence 0.6 + 0.66 + 0.666 + ….. n terms as \[\dfrac{2}{3}n-\dfrac{2}{27}\left[ 1-{{\left( 10 \right)}^{-n}} \right]\].note: in this question, students must note that whenever we are in need to find the sum of series of the type a + aa + aaa + aaaa ….., we always have to make the series of 9 + 99 + 999 + ….. type by multiplying and dividing the whole series by 9 so that we can get a g.p of the type \[10,{{10}^{2}},{{10}^{3}}\]…. also in this question, some students make this mistake of considering 5 + 55 + 555 + …. or 0.6 + 0.66 + 0.666 + …. in g.p which is wrong because we can see that there is no common ratio in these sequences. equating the expression with 0,3x2 + 5x + 2 = 0on factorising it further,3x2 + 3x + 2x + 2 = 03x(x + 1) + 2(x + 1) = 0(3x + 2) (x + 1) = 0 x = - or x = -1 the zeroes of 3x2 + 5x + 2 are – and -1. let i = `(1)/(sinx*(3 + 2cosx))*dx` = `int sinx/(sin^2x*(3 + 2cosx))*dx` = `int sinx/((1 - cos^2x)(3 + 2cosx))*dx` = `int sinx/((1 - cosx)(1 + cosx)(3 + 2cosx))*dx` put cos x = t∴ – sinx.dx = dt∴ sinx.dx = – dt ∴ i = `int (1)/((1 - t)(1 + t)(3 + 2t))*(-dt)` = `int (-1)/((1 - t)(1 + t)(3 + 2t))*dt` let `(-1)/((1 - t)(1 + t)(3 + 2t)) = "a"/(1 - t) + "b"/(1 + t) + "c"/(3 + 2t)` ∴ – 1 = a(1 + t)(3 + 2t) + b(1 - t)(3 + 2t) + c(1 - t)(1 + t)put 1 – t = 0, i.e. t = 1, we get– 1 = a(2)(5) + b(0)(5) + c(0)(2) ∴ – 1 = 10a ∴ a = `(-1)/(10)`put 1 + t = 0, i.e. t = – 1, we get– 1 = a(0)(1) + b(2)(1) + c(2)(0) ∴ – 1 = 2b ∴ b = `-(1)/(2)` put 3 + 2t = 0, i.e. t = `-(3)/(2)`, we get – 1 = `"a"(-1/2)(0) + "b"(5/2)(0) + "c"(5/2)(-1/2)` ∴ – 1 = `-(5)/(4)"c"` ∴ c = `(4)/(5)` ∴ `(-1)/((1 - t)(1 + t)(3 + 2t)) = (((-1)/(10)))/(1 - t) + ((-1/2))/(1 + t) + ((4/5))/(3 + 2t)` ∴ i = `int [(((-1)/10))/(1 - t) + ((-1/2))/(1 + t) + ((4/5))/(3 + 2t)]*dt` = `-(1)/(10) int 1/(1 - t)*dt - (1)/(2) int 1/(1 + t)*dt + (4)/(5) int 1/(3 + 2t)*dt` = `-(1)/(10) (log|1 - t|)/(-1) - (1)/(2) log | 1 + t| + 4/5 (log|3 + 2t|)/(2) + c` = `(1)/(10)log|1 - cosx| - (1)/(2)log|1 + cosx| + (2)/(5)log|3 + 2cos| + c`. associative law of addition:
a + (b+c) = (a+b) + c

commutative law of addition:
a + b = b + a

additive inverse:
a + (-a) = 0

zero property:
a + 0 = a

subtraction is basically the same thing as addition.
a - b = a + (-b)
instead of subtracting b, you add its additive inverse. 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] You need to give the user the option of typing in a value that represents that there are no more values to enter. Perhaps give a prompt like:



```
Please enter a value.  Enter -999999 if you have no more values [B]:[/B]
```

As for the ten (or fewer) values, you should probably have an array and a loop instead of ten separate variable names and ten separate cin statements. So you're looking at something like this:



```
double dValue[10];
    int numEntries = 0;
    double sum = 0;
    
    while (numEntries < 10)
    {
          cout << "Enter number (-999999 to stop) : ";
          cin >> dValue[numEntries];
          // check whether dValue[numEntries] == -999999
          // if so, short-circuit the loop with the "break" command
            
          // increment numEntries
          // adjust sum
    }
```

As a side note, I picked -999999 as the value to represent no more values because



1. It's an integer, so it can be represented exactly as a double (no round-off error using == to compare).
2. It's a number that, chances are, people wouldn't actually want to add, so it's sort of "out of the way". Chances are, few people want to add -999999. If they do, they can't use this program! >> [x,y] = ismember(a,b);
>> [~,z] = sort(y(x));
>> v = find(x);
>> r = reshape(v(z),2,[]).'
r =
 2 9
 4 8
 5 7 answer: `4+1+(1)/(4)+(1)/(6)+...`
solution: n/a (a) for digit



expression : 5n + 1

where n = no of digits

for 5 digits

no of segments required = 5(5) + 1 = 25 + 1 = 26

for 10 digits

no of segments required = 5(10) + 1 = 50 + 1 = 51

for 100 digits

no of segments required = 5(100) + 1 = 500 + 1 = 501

(b) for digit



expression : 3n + 1

where n = no of digits

for 5 digits

no of segments required = 3(5) + 1 = 15 + 1 = 16

for 10 digits

no of segments required = 3(10) + 1 = 30 + 1 = 31

for 100 digits

no of segments required = 3(100) + 1 = 300 + 1 = 301

(c) for digit



expression : 5n + 2

where n = no of digits

for 5 digits

no of segments required = 5(5) + 2 = 25 + 2 = 27

for 10 digits

no of segments required = 5(10) + 2 = 50 + 2 = 52

for 100 digits

no of segments required = 5(100) + 2 = 500 + 2 = 502