Reputation
392
Top tag
Next privilege 500 Rep.
Access review queues
Badges
1 12
Impact
~2k people reached

  • 0 posts edited
  • 1 helpful flag
  • 17 votes cast
Dec
8
comment Finding solution to matrix equation over GF(2) with minimal true variables
This question is equivalent to this question on theoretical computer science. It is NP-complete through a reduction to the minimal-weight code problem.
Dec
5
asked Finding solution to matrix equation over GF(2) with minimal true variables
Nov
28
answered Prove that $\alpha=\beta=\gamma$
Nov
28
revised Maximal tiling without any 3-in-a-rows
added 287 characters in body
Nov
27
revised Maximal tiling without any 3-in-a-rows
added 254 characters in body
Nov
27
answered Maximal tiling without any 3-in-a-rows
May
10
suggested rejected edit on Dividing an angle into $n$ equal parts
May
10
comment Dividing an angle into $n$ equal parts
My answer was incorrect (and trivially so - it implied you can trisect an angle). Oops.
May
4
comment Example of uncomputable but definable number
Could you elaborate what qualifies as a 'really really simple' for the algorithm of $f$?
Apr
29
accepted Is there a fast divisibility check for a fixed divisor?
Apr
27
awarded  Self-Learner
Apr
25
revised Is there a fast divisibility check for a fixed divisor?
added 3 characters in body
Apr
25
revised Is there a fast divisibility check for a fixed divisor?
edited body
Apr
25
revised Is there a fast divisibility check for a fixed divisor?
added 6 characters in body; edited title
Apr
25
comment Is there a fast divisibility check for a fixed divisor?
@BillDubuque Done.
Apr
25
revised Is there a fast divisibility check for a fixed divisor?
added 480 characters in body
Apr
25
comment Is there a fast divisibility check for a fixed divisor?
@TravisJ Correct. That is what I meant with 'constant divisor' in the question.
Apr
25
comment Is there a fast divisibility check for a fixed divisor?
@TravisJ The code I listed is code to generate constants a and b. This is precomputation, and doesn't end up in the final code. The expressions all the way at the bottom of my answer is an example of the generated code for $76 \mid n$ for 64-bit integer $n$.
Apr
25
revised Is there a fast divisibility check for a fixed divisor?
added 2 characters in body
Apr
25
comment Is there a fast divisibility check for a fixed divisor?
@TravisJ Yes, integer division/modulo ranges from expensive to very expensive on CPUs. If I'm not mistaken two comparisons, one multiplication and one bitshift is faster than integer modulo on virtually every CPU in existence. This also extends to operations on very large integers.