bio | website | |
---|---|---|
location | ||
age | ||
visits | member for | 2 years, 3 months |
seen | Apr 15 at 22:44 | |
stats | profile views | 365 |
Apr 9 |
comment |
coin reversal puzzle with one hand and two stacks
@Zack In similar words, I want to reverse one LIFO queue (i.e., a stack) using two other LIFO queues, but the reversed data needs to be in the original LIFO queue and the other two queues cannot feed each other directly. I'll give mathematicians a chance first because I think this is quite difficult and perhaps no algorithm is even known. |
Apr 9 |
revised |
coin reversal puzzle with one hand and two stacks
removed constraint on emptying hand since it was not needed |
Apr 9 |
asked | coin reversal puzzle with one hand and two stacks |
Jan 20 |
awarded | Yearling |
Jan 16 |
comment |
Consecutive Primes mod 3
@quid As Greg said there, that effect goes to zero for large primes, so it wouldn't apply here (I'm looking for effects that stay finite in the asymptotic limit). |
Jan 16 |
comment |
Consecutive Primes mod 3
Just considering consecutive pairs, has anyone proven that there is no asymptotic correlation? For example, is it impossible to have "21" and "12" each occur with a 30% rate, and "11" and "22" each occur with a 20% rate? |
Jan 16 |
comment |
Consecutive Primes mod 3
Is Shiu's result based on hypothesis or pure theory? I can't find the reference from Google and want to try to understand if this is proven with no assumptions. |
Jan 16 |
comment |
Consecutive Primes mod 3
Interesting. Let's say the sequence is "1212222121221111122..." from which I naturally calculate a "predomination sequence", P, as "1111222222222222112...". I can't use your summation (since the starting prime is considered secret), but I suppose that I could calculate the average P and see that it is greater than, for example, 1.501, even as my starting secret prime goes to infinity. Of course, this is all based on hypotheses, so I wonder if someone has tried to measure this limit. |
Jan 16 |
asked | Consecutive Primes mod 3 |
Jan 15 |
accepted | Joint Modular Distribution of Primes |
Jan 15 |
comment |
Joint Modular Distribution of Primes
I really wanted to pose a question about the independence across consecutive primes too, but was vague...so, I'll mark your answer as correct and open a new question. |
Jan 15 |
asked | Joint Modular Distribution of Primes |
Oct 1 |
awarded | Caucus |
Aug 30 |
comment |
Solving a System of Quadratic Equations
I have 6/7 cases like the one I posted (but also set j=f=0 like I said in a different comment). Thanks for the continuing effort! |
Aug 22 |
comment |
Solving a System of Quadratic Equations
Oh, I get it now and Mathematica then computes it quickly. Now that I think about things, I would prefer a minimal solution with j=0 and f=0 (or j=0 and i=0), but Mathematica can't compute this in reasonable time...do you see one? Sorry, I guess I underspecified by problem originally. |
Aug 22 |
comment |
Solving a System of Quadratic Equations
I wasn't aware of the Groebner basis method. But, when I try this approach in Mathematica (version 6), the software is still thinking after hours, so it's been of no use to me. Are you using your own home-built software? I'll wait to close this question until others have had a chance to answer about minimization approaches, but I do believe your method is best in cases where a zero exists. |
Aug 22 |
comment |
Solving a System of Quadratic Equations
Interesting idea, but I would guess any improvement from the convexity is more than offset by the increase in functional complexity (from the inverse matrix). Still, I hope you try my example (or a similar one with higher constants so that there is no zero and the problem is truly a minimization problem) and prove me wrong...please keep us posted. |
Aug 21 |
comment |
Solving a System of Quadratic Equations
Real solutions only. @Dietrich Great, but are you able to find one solution from that basis in a reasonable time? |
Aug 21 |
asked | Solving a System of Quadratic Equations |
Aug 18 |
comment |
Embedding of Two Objects Into Higher Dimensions With Their Sum
I agree. Though the simpler problem is NP-hard, it's still analytically solvable. This tougher problem, however, is forcing me into numerical solutions. |