Andrew Tomazos
Reputation
856
Next privilege 1,000 Rep.
Create new tags
 Aug 26 revised Combinations of nonincreasing sequences within bounds? added 187 characters in body Aug 26 comment Combinations of nonincreasing sequences within bounds? @GerryMyerson: What do you mean? $a_i$ can be any integer, as can $b_i$. Obviously if for some $i$, $a_i > b_i$ than the answer to the question is zero. Likewise if for some $i$, $b_i < a_{i+1}$ then the answer is also zero. Aug 25 comment Elementary power equation: $k_1k_2^x = k_3k_4^x$ Wow, it seems obvious now - exponentiation becomes multiplication in log space - as multiplication becomes addition Aug 25 asked Combinations of nonincreasing sequences within bounds? Aug 25 comment Elementary power equation: $k_1k_2^x = k_3k_4^x$ I've always found it unintuitive for some reason that $\log_c(a^b) = b\log_c(a)$. I find it hard to visualize a physical model that demonstrates this. Aug 25 asked Elementary power equation: $k_1k_2^x = k_3k_4^x$ Aug 17 comment Maximization of a sum subject to constraints on 3 resources @AngelaRichardson: Information is lost. Your equation is implied by the triple equation, however the reverse is not true. Aug 17 comment Maximization of a sum subject to constraints on 3 resources As the xs are constant you can generalize it to that, but is there a way to take advantage of the fact that the xs repeat in all six permutations to give a simpler solution? Aug 17 asked Maximization of a sum subject to constraints on 3 resources Aug 14 asked Properties of “Digit Sum Root”? Aug 11 comment Efficiently evaluating the Motzkin numbers @Chan: If it was a prime base, then you can use the modular inverse. If it isn't a prime base, than you can use arbitrary precision arithmetic. Aug 9 revised Prime Identification easier than Prime Factorization? added 410 characters in body Aug 9 comment Prime Identification easier than Prime Factorization? I need 100% accuracy on the integers between 1 and 10^20. If there is a single false positive or negative in this range it is useless for my purposes. Aug 8 comment Prime Identification easier than Prime Factorization? I need 100% accuracy and only the running time of the worst case input N matters (ie argmax 2 < i < 10^20 of running time of isPrime(i)). Aug 8 revised Prime Identification easier than Prime Factorization? added 392 characters in body Aug 8 asked Prime Identification easier than Prime Factorization? Aug 7 accepted Modulus Distributing Over Multiplication? Aug 7 comment Modulus Distributing Over Multiplication? I tried to prove the answer and added it to the bottom of my question. Aug 7 revised Modulus Distributing Over Multiplication? added 512 characters in body Aug 3 comment Modulus Distributing Over Multiplication? So the answer is always. So whats the big deal about having a prime base then? Its just having a modular inverse for everything?