Ask your own question, for FREE!
Mathematics 8 Online
ganeshie8 (ganeshie8):

how this interesting pattern works ? 1 * 9 + 2 = 11 12 * 9 + 3 = 111 123 * 9 + 4 = 1111 1234 * 9 + 5= 11111 12345 * 9 + 6 = 111111 123456 * 9 + 7 = 1111111 1234567 * 9 + 8 = 11111111 12345678 * 9 + 9 = 111111111 http://jwilson.coe.uga.edu/EMAT6680/LeeSJ/emat6690/essay1/main.html

jagr2713 (jagr2713):

do we continue the pattern

OpenStudy (anonymous):

cool

ganeshie8 (ganeshie8):

thats a good question @jagr2713 , im not sure if we can continue as all the digits are already usedup on left hand side hmm

OpenStudy (anonymous):

thats cool

OpenStudy (mathmath333):

\((0\times 9+1=1)\) \(\leftarrow \text{upper term missing}\)

OpenStudy (anonymous):

the last digit of 1, 12, 123, etc all multiplied by 9 become less and less as 2, 3, 4 etc get larger.

OpenStudy (anonymous):

the first number (1,12,123,1234 etc) multiplied by 9. add the third number and you get the sequence of 1^x

OpenStudy (anonymous):

\(\Large \begin{align*} \sum _{k=0}^n 10^{n-k} &= \sum _{k=0}^n 10^{n-k} +\sum _{k=0}^n k 10^{n-k}- \sum _{k=0}^n k 10^{n-k} \\ &= \sum _{k=0}^n (k+1)10^{n-k}-\sum _{k=0}^n k 10^{n-k} \\ &= \sum _{k=0}^{n-1} (k+1)10^{n-k}-\sum _{k=0}^n k 10^{n-k}+(n+1)\\ &= 10 \sum _{k=0}^{n} (k)10^{n-k}-\sum _{k=0}^n k 10^{n-k}+(n+1)\\ &= (10-1)\sum _{k=0}^n k 10^{n-k}+(n+1) \end{align*}\)

OpenStudy (anonymous):

What happens when you use binary?

OpenStudy (anonymous):

\[ 1_b*1001_b+10_b = 1011_b \]Amazing.

OpenStudy (anonymous):

\[ 1100_b*1001_b+11_b = 101111_b \]Unbelievable.

OpenStudy (anonymous):

ok i should add this to my solution number of 1's digits is \(\Large (n+1)\)

ganeshie8 (ganeshie8):

thats interesting xD i think it wil take few minutes for me to comprehend the proof

ganeshie8 (ganeshie8):

it seems you're starting wid \[111\ldots (\text{n+1 times}) = \begin{align} \sum _{k=0}^n 10^{n-k} \end{align}\]

OpenStudy (anonymous):

yep

OpenStudy (zzr0ck3r):

12*9+3 = 11*9+1*8+2+1= 11*9+1+1*9+2 100+11 123*9+4 = 111*9+1+12*9+3 1000+11 I bet induction would do it

OpenStudy (kainui):

WOW @Marki !!!!!! How did you think to discover this?!

OpenStudy (anonymous):

:)

OpenStudy (kainui):

This reminds me a lot of how 999 = 9*10^2+9*10^1+9*10^0, I wonder if we can find some larger theory of all of this where both of these results are just easy and obvious to see?

OpenStudy (anonymous):

?

OpenStudy (anonymous):

what does this means ? "larger theory of all of this where both of these results are just easy and obvious to see?"

ganeshie8 (ganeshie8):

I'm strugglign a bit wid this step : http://gyazo.com/e404b91fe44bba07363a3cb0d93d6c1a how did you change the bounds just like that ?

OpenStudy (anonymous):

can u see it now ? \(\begin{align*} \sum _{k=0}^{n-1}(k+1)10^{n-k} &= 10^n+2.10^{n-1}+3.10^{n-2}+\dots+(n-1)10^2+n10\\ &= 10\left ( 10^{n-1}+2.10^{n-2}+3.10^{n-3}+\dots+(n-1)10+n\right )\\ &= 10 \sum _{k=0}^n k^{n-k}\\ \end{align*}\)

OpenStudy (anonymous):

another approach \(\begin{align*} \sum _{k=0}^{n-1}(k+1)10^{n-k} &=10\sum _{k=0}^{n-1}(k+1)10^{n-k-1} \\ &= 10\sum _{k=0}^{{\color{Red} {n-1}}}(k+1)10^{{\color{Red} {(n-1)}}-k} ~~~~~\\ &= 10 \sum _{k=0}^{\color{Red} n} k^{{\color{Red} n}-k} \color{Red}{\text{we can sub one variable instead of n-1 }} \\ \end{align*}\)

OpenStudy (anonymous):

@ganeshie8

OpenStudy (rational):

\[\begin{align*} \sum _{k=0}^{n-1}(k+1)10^{n-k} &=10\sum _{k=0}^{n-1}(k+1)10^{n-k-1} \\ &= 10\sum _{k=0}^{{\color{Red} {n-1}}}(k+1)10^{{\color{Red} {(n-1)}}-k} ~~~~~\\ &= 10 \sum _{k=0}^{\color{Red} n} 10^{{\color{Red} n}-k} \color{Red}{\text{we can sub one variable instead of n-1 }} \\ \end{align*}\]

OpenStudy (anonymous):

i made a typo

OpenStudy (rational):

Makes sense thanks ! im not sure why ganeshie is overthinking :O

OpenStudy (anonymous):

\(\begin{align*} \sum _{k=0}^{n-1}(k+1)10^{n-k} &= 10^n+2.10^{n-1}+3.10^{n-2}+\dots+(n-1)10^2+n10\\ &= 10\left ( 10^{n-1}+2.10^{n-2}+3.10^{n-3}+\dots+(n-1)10+n\right )\\ &= 10 \sum _{k=0}^n k10^{n-k}\\ \end{align*} \) \(\begin{align*} \sum _{k=0}^{n-1}(k+1)10^{n-k} &=10\sum _{k=0}^{n-1}(k+1)10^{n-k-1} \\ &= 10\sum _{k=0}^{{\color{Red} {n-1}}}(k+1)10^{{\color{Red} {(n-1)}}-k} ~~~~~\\ &= 10 \sum _{k=0}^{\color{Red} n}k10^{{\color{Red} n}-k} \color{Red}{\text{we can sub one variable instead of n-1 }} \\ \end{align*}\) like this

OpenStudy (anonymous):

hehe ikr @rational ;)

OpenStudy (rational):

nice nice

OpenStudy (anonymous):

:)

OpenStudy (rational):

just wondering if we can use derivative of sum cleverly here

OpenStudy (rational):

\[\sum x^k = \dfrac{x^{k+1}-1}{x-1} \implies \sum kx^{k-1} = (\dfrac{x^{k+1}-1}{x-1})'\] but the k's seem to run in reverse direction in your formula so idk if this works

OpenStudy (anonymous):

its work :O

OpenStudy (kainui):

That's what I was working on earlier actually, here's what I got: \[\Large \sum_a^b x^n = \sum_a^bx^{b+a-n}=\frac{x^b-x^a}{x-1}\]

OpenStudy (kainui):

\[\Large \sum_a^b(b+a-n)x^{b+a-n}=\frac{bx^b-ax^a}{x-a}+\frac{x^{a+1}-x^{b-1}}{(x-1)^2}\]

OpenStudy (kainui):

So the first formula has three parts, the first is adding from a to b, the second sum is adding from b to a just like @Marki did, and the right part is the sum of the geometric series, since that's all it is. The next equation is the derivative, but then I multiplied both sides of the equation by x to get rid of the x^{-1} term. Then you can also see that the last one I couldn't fit it all on one line: \[\Large \sum_a^b nx^n = \sum_a^b (b+a-n)x^{b+a-n}\] since remember, there were three parts to the first one. Anyways, have fun playing with this like I did haha. =P

OpenStudy (rational):

\[\Large \sum_a^b x^n = \sum_a^bx^{b+a-n}=\frac{x^{b+1}-x^a}{x-1} \]

OpenStudy (rational):

first part is clear, im still going thru second part xD

OpenStudy (anonymous):

haha cute

OpenStudy (kainui):

I'm working on rewriting Marki's awesome argument in terms of this more general expression. I'll explain in a second...

OpenStudy (kainui):

Ok here it comes!

OpenStudy (kainui):

\[\large \sum_{k=a}^b x^{a+b-k} = \sum_{k=a}^b x^{a+b-k} + \sum_{k=a}^b kx^{a+b-k}- \sum_{k=a}^b kx^{a+b-k}\] \[\large \sum_{k=a}^b(k+1) kx^{a+b-k}- \sum_{k=a}^b kx^{a+b-k}\]\[\large \sum_{k=a-1}^{b-1}(k+1) kx^{a+b-k}- \sum_{k=a}^b kx^{a+b-k} +[ (1+b)x^a-ax^{b+1}]\]\[\large x \sum_{k=a}^{b}k x^{a+b-k}- \sum_{k=a}^b kx^{a+b-k} +[ (1+b)x^a-ax^{b+1}]\] \[\large (x -1) \sum_{k=a}^b kx^{a+b-k} +[ (1+b)x^a-ax^{b+1}]\] To recover @Marki 's formula, just let x=10, a=0, and b=n and everything is exactly the same =D

OpenStudy (rational):

looks neat xD i hope we can do things like changing the base etc and have a little more fun enjoy your breakfast @Kainui :)

OpenStudy (anonymous):

xD give me two weeks only and i promise to solve everything xD

OpenStudy (rational):

prepare for ur exams @Kainui please ban Marki

OpenStudy (anonymous):

bhahaha he wont dare :P

OpenStudy (anonymous):

ok, enjoy ur bf kai xD

OpenStudy (anonymous):

i'll go now .

OpenStudy (kainui):

Hahaha XD Yeah I wouldn't ban Marki, she'll find a way to come track me down and make me pay for it. I'll let ganeshie ban her haha XD

OpenStudy (kainui):

@rational We can also see other stuff in base 10 too! Like if you plug in x=10^2 we will get another pattern of things.

OpenStudy (kainui):

Here's one example, and I'll show you another one in a second:

OpenStudy (kainui):

99*(0)+1 = 1 99*(1)+2 = 101 99*(102)+3 = 10101 99*(10203)+4 = 1010101 99*(1020304)+5=101010101 ... see! Very fascinating!

OpenStudy (anonymous):

hmm yes

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!