CURED - 2024-01-01

« first day (4372 days earlier) ← previous day next day → last day (418 days later) »

Hank Scorpio

01:28

way too broad: close

14 hours later…

Peter

15:43

please close/delete - again answered by a high-rep user.

Feeds

Q: fractal like approach: possible to pin nontrivial zeros?

About six years ago when I first joined the site I asked a question: Bounded vector field in a square region (soft question). Even though user539887 kindly gave me an answer something just really bothered me, and I couldn't forget about this question. This is a continuation of that question. Cons...

2 hours later…

Jyrki Lahtonen

18:01

What do the CURED regulars think about this?. The question is a bit lacking in context, but I admit that I find the problem enticing. To the point that I'm considering placing a bounty on it (unless I can work it out myself). But I definitely don't want to be at odds with the quality control!

Currently the post has +6/-2 votes and 1 vote to close.

The alternative is to follow this policy. That is an option.

Xander Henderson

@JyrkiLahtonen In what way would you rewrite it in order to save it?

(The question certainly lacks context, and simply being "enticing" to another mathematician is not necessarily good enough... I really wish we just had a "no homework" policy, which would allow questions like that, but weed out 90% of the crap that gets posted.)

Jyrki Lahtonen

@XanderHenderson I would add the contents of the comment by Kenta S (proving that a prime cannot work) together with what I figured out when looking at the case where n is a product of two primes.

Jyrki Lahtonen

18:21

Anyway, that kind of edits would make it a new question. Merge would not be useful, because the current version has no answers. Hmm. Looks like I was about to misstep. Thanks for the reminders @Xander.

5 hours later…

SmokeDetector

22:54

[ SmokeDetector | MS ] Url in title (94): Exact form for recursive terms about [A075680](oeis.org/A075680)‭ by 7888‭ on math.SE

Feeds

23:11

Q: Exact form for recursive terms about [A075680](https://oeis.org/A075680)

The exact formula for numbers with first few n in A075680 are: (1) $\frac{4^n-1}{3}$ (2) $\frac{4^{3n+1.5}-5}{9}, \frac{4^{3n+2.5}-7}{9}$ (3) $\frac{4^{9n+a_{3_0}}-19}{27}, \frac{4^{9n+a_{3_1}}-23}{27}, \frac{4^{9n+a_{3_2}}-29}{27}, \frac{4^{9n+a_{3_3}}-37}{27}$ ... (n) $\frac{4^{3^{n-1}+a_n}-b_n...