bio | website | |
---|---|---|
location | ||
age | ||
visits | member for | 3 years, 7 months |
seen | 2 days ago | |
stats | profile views | 387 |
Jul
31 |
accepted | Particular case of Beal's Conjecture |
Jul
31 |
comment |
Particular case of Beal's Conjecture
Thanks. I guess I could now ask the question for exponents (3,4,5), which seems to be the new leading unproven candidate, but don't want to give @quid an ulcer! |
Jul
31 |
comment |
Particular case of Beal's Conjecture
@quid The order is important. This case is different:(3,4,3) or equivalently (4,3,3). |
Jul
31 |
comment |
Particular case of Beal's Conjecture
@quid Where is it "on the site linked to"? I don't think the Wikipedia page has any conclusion for this case, which is why I asked the question. |
Jul
31 |
asked | Particular case of Beal's Conjecture |
Jan
12 |
awarded | Popular Question |
Nov
1 |
awarded | Popular Question |
Jul
2 |
awarded | Curious |
Jun
30 |
awarded | Popular Question |
Apr
30 |
comment |
All Integers from the Smallest Digit Stream with a Window Filter
yes, you understand it correctly |
Apr
29 |
comment |
All Integers from the Smallest Digit Stream with a Window Filter
I didn't know about DeBruijin. The answer is therefore yes, and, even more amazing, a contiguous window can always be used. So, that begs the question, can a stream be found for any given window? By your comment, I guess you extended my question to this already. Thanks. |
Apr
29 |
comment |
All Integers from the Smallest Digit Stream with a Window Filter
This might be confusing because my digits in the example ranged from 1 to 3. It's more normal to use a range from 0 to 2, so subtract one from all digits if that makes it more intuitive. |
Apr
29 |
asked | All Integers from the Smallest Digit Stream with a Window Filter |
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. |