user54089
Reputation
Top tag
Next privilege 100 Rep.
Edit community wikis
 Mar13 comment How to create a generating function / closed form from this recurrence? Can you explain the last step at all, how you get to 7x + ... etc Mar13 accepted How to create a generating function / closed form from this recurrence? Mar13 asked How to create a generating function / closed form from this recurrence? Feb5 accepted Concatenated number mod m Feb5 comment Concatenated number mod m sorry, I mean each variable is a digit 0-9 (first digit 1-9). otherwise yes Feb5 awarded Commentator Feb5 comment Concatenated number mod m integers yes. I assumed I could just add the values all mod m but am unsure Feb5 comment Concatenated number mod m Basic yes, but having trouble here Feb5 asked Concatenated number mod m Jan7 awarded Scholar Jan7 accepted Is n! mod p doable in sub O(n) time? Jan7 comment Is n! mod p doable in sub O(n) time? forgive my ignorance but explain p(x) please? Jan7 comment Is n! mod p doable in sub O(n) time? Well i can solve it iteratively by multiplying by n-k+1 all the way up modulo p every step. rationale: (n!/((n-k)!)) /(n!/((n-(k-1))!)) = n-k+1 Jan7 comment Is n! mod p doable in sub O(n) time? technically time complexity of min(n,p) i think, right? Jan7 comment Is n! mod p doable in sub O(n) time? i also know about the zero condition but i am mainly concerned about nontrivial case k < p Jan7 comment Is n! mod p doable in sub O(n) time? arbitrary. i am writing a function Jan7 comment Is n! mod p doable in sub O(n) time? I mean this may be an XY question or whatever. I just want n choose k mod p in fast execution. I just thought the factorial difference was what i needed. mywiki.wooledge.org/XyProblem Jan7 comment Is n! mod p doable in sub O(n) time? well i know how to get combinations quickly and i know the only difference between combinations and permutations is a denominator factor of k! Jan7 asked Is n! mod p doable in sub O(n) time? Dec23 comment Division into $x(x-1)$ Right but this is maximal x given g