Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I've got the following inequality, which bounds Minkowski distance.
${4}^{k}\cdot n\leq \displaystyle\sum^{n}_{i=1}{a}_{i}^{k}\leq {5}^{k}\cdot n$
and values of ${a}_{i}\in {1,2,3,4,5,6}$
We know all values of ${a}_{i}$, the question is for which (minimal) integer $k$ above equation is satisfied ? Any necessary or sufficient conditions except obvious one that not for all $i$, $5\leq {a}_{i}$ ?

share|improve this question
1  
Another obvious necessary condition is that the $a_i$ shouldn't all be $1$. But in general it seems to me that the minimal integer $k$ will depend in a complicated way on the $a_i$. I'd be surprised if there were a neat answer. –  Gerry Myerson Mar 19 '13 at 23:11

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.