552 views
0 votes
0 votes

The following is a sequence of formula,

$$\begin{align*} \begin{matrix} & 9*1+2 &= &11 \\ & 9*12+3 &= &111 \\ & 9*123+4 &= &1111 \\ & 9*1234+5 &= &11111 \\ \end{matrix} \\ \dots \dots \dots \dots \dots \dots \\ \end{align*}$$

Here numbers are in base $10$.

(a) Establish a formula in $\sum$ notation.

(b) Generalize that formula in for any base $b$..

2 Answers

0 votes
0 votes

(a)- 9* $\sum\limits_{i=0}^{n-1}(n-1)*10^{i}+(n+1)$ where n is the number of digits in your series of 1,12,123 etc

(b)- Little modifications to (a)

Lemme know if I am wrong.

edited by

Related questions

0 votes
0 votes
2 answers
1
dd asked Feb 25, 2017
523 views
Prove or disprove: $\begin{align*} \log_8x = \frac{1}{2}.\log_{2}x \end{align*}$.
0 votes
0 votes
2 answers
2
dd asked Feb 22, 2017
467 views
Prove or disprove the following: for finite sets A and B, $\overline{(A - B) \cup (B - A)} = A \cap B$ . If the proposition is incorrect, do minimal modifications to the ...
0 votes
0 votes
1 answer
3
dd asked Feb 22, 2017
459 views
Prove the following: $3 \; | \;\left ( a^2+b^2 \right )$ if and only if $3 \; | \;a$ and $3 \; | \;b$.
0 votes
0 votes
0 answers
4
dd asked Feb 22, 2017
334 views
Let $w \in \sum$$*$ be a string, with $\sum$ being the alphabet. Let $w^R$ be the reversal of string $w$, using induction prove that $(w^R)(w^R). . .(\text{for k times}) ...