1
vote
1answer
42 views

Sum of a series involving modulus operator

I'm attempting to work out a problem that involves summing a series of numbers. I know the formula to find each element of the series, but I do not know how to use this to make an equation for the ...
0
votes
1answer
39 views

The closed form of a sum of mod(k,m) where k goes from 1 to a arbitrary number.

Is there a closed form for $\sum_{n=0}^{C} mod(n,m)$ for arbitrary integers m ?
0
votes
1answer
51 views

How to maximize $n!\sum^n_{k = 0}\frac{a^k(1+(-1)^{n-k})}{k!(n-k)!} \pmod{a^2}$ for a given $a$?

Short Version of the Question: How do I maximize the value of $n!\sum^n_{k = 0}\frac{a^k(1+(-1)^{n-k})}{k!(n-k)!} \pmod{a^2}$ for a given $a$? Long Version of the Question: I'm currently attempting ...
1
vote
3answers
202 views

How to solve $ \sum_{i=1}^{n-1} i^2 \equiv \;? \pmod n$

I solved expressions below . it is ok? My attempt: $$1)\;\;\;\;\; ?\cong\pmod n\sum_{i=1}^{n-1} i^2 \stackrel{?}= ...
1
vote
0answers
78 views

Need help simplifying an equation.

I'm trying to speed up the following code: sum = 0 for (k = 1 ... N) { f = Fibonacci(k); for (a = 1 ... 24) for (b = 1 ... 24) for (c = 1 ... 24) { sum = sum + m(a, b, c) // ...
0
votes
2answers
65 views

Computing $\left\lfloor\sum_{k = 1}^{n}{\varphi^{3k}}\right\rfloor$

I'm trying to find $\left\lfloor\sum_{k = 1}^{n}{\varphi^{3k}}\right\rfloor$ mod $m$. $\varphi = \frac{1 + \sqrt{5}}{2}$ and $\varphi^3 = 2 + \sqrt{5}$. But honestly I'm not even sure where to start. ...
1
vote
1answer
367 views

modulo of series summation

I have trouble with computing modulo. First, I have a summation of series like this: $$1+3^2+3^4+\cdots+3^n$$ And this is the formula which can be used to compute the series: ...