n0nChun
Reputation
Next privilege 250 Rep.
 Jan 30 awarded Popular Question Jan 11 awarded Popular Question Jul 2 awarded Curious Sep 6 awarded Critic Sep 1 comment Modulo of (Power of 2 divided by a number) Wonderful! This seems like a cool trick. Thanks to you, I learned something new :) Sep 1 accepted Modulo of (Power of 2 divided by a number) Sep 1 comment Modulo of (Power of 2 divided by a number) Hey jyrki, I was able to reduce the problem of finding the coefficients of I and J to finding the exponentiation of a 2x2 matrix and my solution got accepted! Thanks for the pointers :) btw, why did you think of breaking the problem into I - J , and not the original matrix? Aug 31 comment Modulo of (Power of 2 divided by a number) I understand this method, and I wanted to use it too, but if n is large say 50000, then the matrix sizes $O(n^2)$ become huge! Aug 31 comment Modulo of (Power of 2 divided by a number) Thanks kind sir :) Aug 31 comment Modulo of (Power of 2 divided by a number) Looks like I will have to chuck my current approach and look for a more novel technique. I can actually solve this problem using matrix exponentiation, but I am not able to reduce this matrix size to a constant :( Aug 31 awarded Commentator Aug 31 comment Modulo of (Power of 2 divided by a number) Oh, isn't there any other way then, to get the quantity that I wanted? I mean $(2^a/b)\mod K$ ? I need to solve an algorithm problem, and one way to do it demands me to calculate this quantity. You can too, probably take a look at the problem spoj.pl/problems/SUMSUMS Aug 31 comment Modulo of (Power of 2 divided by a number) I wanted the floor value of the division.. Aug 31 comment Modulo of (Power of 2 divided by a number) Ok, at the risk of sounding stupid, $2^4 = 16$ and $16/3 = 5$ so I should be getting $5%K = 5$, since $5 < K$. And I did get $65843626$ as the result too. Aug 31 asked Modulo of (Power of 2 divided by a number) Aug 30 comment Number of distinct points at which runners meet. Yeah, well the first meeting point is C/(v-u), considering the circumference is C and v>u. Now the meetings points are going to be multiples of this. So nC/(v-u) is going to be equal to some kC/(v-u). Since, the path is circular, I'm expecting n can be decomposed to something less than C using modulo, but I'm getting nowhere with this approach :| Aug 30 asked Number of distinct points at which runners meet. Aug 26 comment When is the sum of divisors a prime? Thanks, that did help. Am I right in saying that we will not be able to predict in constant time if the sum of the divisors of a number going to be prime or not? Aug 25 answered how can one solve for $x$, $x =\sqrt{2+\sqrt{2+\sqrt{2\cdots }}}$ Aug 25 asked When is the sum of divisors a prime?