$\boxed 1$ How many ways writing positive integer $n\;$ as the sum of the positive integers different each pairs? (no permutation)
Example: $6=6=1+5=2+4=1+2+3 \quad $ (4 ways)
$\boxed 2$ How many ways writing positive integer $n\;$ as the sum of the positive integers? (no permutation)...
Re: What to do when can't get Latex formatted correctly?
I want show codecogs
by formula
$\displaystyle \sum_{k=1}^{n-1}\sin\left(\frac{\left(2\left\lfloor\sqrt{kn}\right\rfloor+1\right)\pi}{2n}\right)=\cot\left(\frac{\pi}{2n}\right)\cos\left(\frac{\pi}{2n}\right)$
but no preview :(...
A "magic square" is an $n\times n$ table includes $n^2$ non-negative integers satisfying conditions sum on each row and each column are equal and equal to $r$.
Define $S_3(r)$ is number of all $3\times 3$ magic square with row sum is $r$
Prove that:
$\displaystyle S_3(r)={r+2\choose...
very nice solution!
Some similar results
$a_n=1+\left\lceil\dfrac{n(n-2)}{3}\right\rceil$
$a_n=1+(2n-2)\left\lfloor\dfrac{n}{3}\right\rfloor-3\left\lfloor\dfrac{n}{3}\right\rfloor^2$
Also, by induction show that $a_n-a_{n-1}=\left\lfloor\dfrac{2(n-1)}{3}\right\rfloor$
Define $\{a_n\}$ is integer sequences (all term are integers) satisfy condition
$a_n=a_{n-1}+\left\lfloor\dfrac{n^2-2n+2-a_{n-1}}{n}\right\rfloor $ for $n=1,2,...$
*note: $\left\lfloor x\right\rfloor$ is a greatest integer number less than or equal $x$
Find general term of sequences.