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.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Using Mathematica I found that the relation $$\sum_{k=1}^n\left(\left(\frac{3}{2}\right)^k\ (\mathrm{mod}\ 1)\right)\approx\frac{n}{2}$$ seems to hold. Actually, every fraction of the form $\frac{b}{a}$, with $b>a$ and $\mathrm{gcd}(a,b)=1$, seems to behave similarly. Example, $\frac{3}{2}$:

graph

So, can we prove some asymptotic formula or somehow show that this behavior is constant?

share|cite|improve this question
up vote 0 down vote accepted

You might be interested in this: http://mathworld.wolfram.com/PowerFractionalParts.html

share|cite|improve this answer
    
Ooh, I am. Thanks! – Carolus Jul 3 '12 at 10:16

Your Answer

 
discard

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

Not the answer you're looking for? Browse other questions tagged or ask your own question.