MHB Can you prove the Floor Function Challenge?

anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Prove $$\sum_{k=1}^{n}\left\lfloor{\left(\frac{k}{2}\right)^2}\right\rfloor=\left\lfloor{\dfrac{n(n+2)(2n-1)}{24}}\right\rfloor$$.
 
Mathematics news on Phys.org
anemone said:
Prove $$\sum_{k=1}^{n}\left\lfloor{\left(\frac{k}{2}\right)^2}\right\rfloor=\left\lfloor{\dfrac{n(n+2)(2n-1)}{24}}\right\rfloor$$.
I shall prove the same for n even
we have for k even

$\lfloor (\dfrac{k}{2})^2 \rfloor = (\dfrac{k}{2})^2\cdots(1)$ because $ (\dfrac{k}{2})$ is integer

further we have for k odd say (2m-1)

$\lfloor (\dfrac{k}{2})^2 \rfloor$

= $\lfloor (\dfrac{2m-1}{2})^2 \rfloor$

= $\lfloor \dfrac{4m^2-4m +1}{4} \rfloor$

= $\lfloor m^2-m + \dfrac{1}{4} \rfloor$

= $m^2-m$so summing the given expression from k = 1 to n breaking into even part and odd part we get

$\sum_{k=1}^{n}\left\lfloor{\left(\frac{k}{2}\right)^2}\right\rfloor$

= $\sum_{k=1}^{\frac{n}{2}}\left\lfloor{\left(\frac{2k-1}{2}\right)^2+ \left(\frac{2k}{2}\right)^2}\right\rfloor$ justified to merge the 2 because 2nd expression is integer

= $\sum_{k=1}^{\frac{n}{2}}{k^2-k+ k^2}$

= $\sum_{k=1}^{\frac{n}{2}}{2k^2-k}$

= $2 * \dfrac{\frac{n}{2}\cdot(\frac{n}{2}+1)\cdot(n+1)}{6}- \dfrac{\frac{n}{2} \cdot (\frac{n}{2}+1)}{2}$

= $\dfrac{n\cdot(n+2)\cdot(n+1)}{12}- \dfrac{n\cdot(n + 2)}{8}$

= $n\cdot(n+2)(\dfrac{2n-1}{24})$

= $\dfrac{n\cdot(n+2)\cdot(2n-1)}{24}$



becuase above is integer ( being sum of integers) hence same as $\lfloor \dfrac{n\cdot(n+2)\cdot(2n-1)}{24}\rfloor $

hence the result
 
kaliprasad said:
I shall prove the same for n even
we have for k even

$\lfloor (\dfrac{k}{2})^2 \rfloor = (\dfrac{k}{2})^2\cdots(1)$ because $ (\dfrac{k}{2})$ is integer

further we have for k odd say (2m-1)

$\lfloor (\dfrac{k}{2})^2 \rfloor$

= $\lfloor (\dfrac{2m-1}{2})^2 \rfloor$

= $\lfloor \dfrac{4m^2-4m +1}{4} \rfloor$

= $\lfloor m^2-m + \dfrac{1}{4} \rfloor$

= $m^2-m$so summing the given expression from k = 1 to n breaking into even part and odd part we get

$\sum_{k=1}^{n}\left\lfloor{\left(\frac{k}{2}\right)^2}\right\rfloor$

= $\sum_{k=1}^{\frac{n}{2}}\left\lfloor{\left(\frac{2k-1}{2}\right)^2+ \left(\frac{2k}{2}\right)^2}\right\rfloor$ justified to merge the 2 because 2nd expression is integer

= $\sum_{k=1}^{\frac{n}{2}}{k^2-k+ k^2}$

= $\sum_{k=1}^{\frac{n}{2}}{2k^2-k}$

= $2 * \dfrac{\frac{n}{2}\cdot(\frac{n}{2}+1)\cdot(n+1)}{6}- \dfrac{\frac{n}{2} \cdot (\frac{n}{2}+1)}{2}$

= $\dfrac{n\cdot(n+2)\cdot(n+1)}{12}- \dfrac{n\cdot(n + 2)}{8}$

= $n\cdot(n+2)(\dfrac{2n-1}{24})$

= $\dfrac{n\cdot(n+2)\cdot(2n-1)}{24}$



becuase above is integer ( being sum of integers) hence same as $\lfloor \dfrac{n\cdot(n+2)\cdot(2n-1)}{24}\rfloor $

hence the result
now based on result of even we prove for odd ( last n-1 terms + nth term , n is odd)
we have shown that for k odd = 2m- 1
$\lfloor (\dfrac{k}{2})^2 \rfloor$
= $\lfloor (\dfrac{2m-1}{2})^2 \rfloor$
= $\lfloor \dfrac{4m^2-4m +1}{4} \rfloor$
= $\lfloor m^2-m + \dfrac{1}{4} \rfloor$
= $m^2-m$
= $m(m-1)$
= $\dfrac{n+1}{2} \dfrac{n-1}{2}$
= $\dfrac{n^2-1}{4}$Now sum upto n terms

= $sum_{k=1}^{n}\left\lfloor{\left(\frac{k}{2}\right)^2}\right\rfloor$
= $(sum_{k=1}^{n-1}\left\lfloor{\left(\frac{k}{2}\right)^2}\right\rfloor)+ \left\lfloor{\left(\frac{n}{2}\right)^2}\right\rfloor$
= $\dfrac{(n-1)(n+1)(2n-3)}{24} + \dfrac{n^2-1}{4}$ (sum upto n-1 terms n-1 even taken care)
= $\dfrac{(n-1)(n+1)(2n-3)+6n^2-6}{24}$
= $\dfrac{(n^2-1)(2n-3)+6n^2-6}{24}$
= $\dfrac{2n^3-3n^2-2n + 3+6n^2-6}{24}$
= $\dfrac{2n^3+ 3n^2-2n - 3}{24}$
= $\dfrac{n(2n^2 + 3n-2) - 3}{24}$
= $\dfrac{n(n+2)(2n-1)}{24} -\dfrac{1}{8}$
= $\lfloor \dfrac{n(n+2)(2n-1)}{24} \rfloor$
 
Thank you kaliprasad for your solution, very well done! My approach is more or less the same as yous, just so you know. :)
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top