CURED - 2022-07-16

« first day (3838 days earlier) ← previous day next day → last day (651 days later) »

12:40 AM

Q: if a hailstone number could go up infinitely would it eventually be divisible by a power of two and end on itself

In the Collatz sequence the number of steps of (3n+1)/2 that a number makes before it is divisible by two more than once is equal to the number of times that you can do (n-1)/2 while landing on an odd number. This means that we can do 2n+1 to increase the number of steps. If we could prove that a...

collatz-conjecture

2 hours later…

Feeds

2:37 AM

-2

A: Requests for Reopen & Undeletion Votes (volume 01/2022 - today)

While reading an an answer to What should I do if I find the answer to an old question of mine that was automatically deleted as abandoned? over at the main StackExchange Meta site, I came across the following comments: This topic math.stackexchange.com/questions/2706956 with beautiful problem ...

Xander Henderson

@user2661923 I expressed an opinion that the question adds little of value to the site, as it is a duplicate of a previous question. Your response boils down to "No it isn't."

You have not convinced me that it is not a duplicate, and you don't even seem to be trying to do so. As such, it appears that we have a simple difference of opinion.

However, you state "...such as amending the quality standards to require that questions be of general interest." Questions on the SE network are meant to serve both the asker and future askers. If a question is of value only to one asker, it might as well be closed and deleted once answered.

There is no need to amend the standards to change this---it is already part of the underlying philosophy of the SE model.

3 hours later…

SmokeDetector

5:13 AM

[ SmokeDetector | MS ] Offensive answer detected (78): What happens inside when differentiating complex functions‭ by F.N.‭ on math.SE

4 hours later…

Peter

8:44 AM

low quality questions keep getting answered and the answers keep getting upvoted and accepted. this is another witness

Peter

9:07 AM

and another one here

3 hours later…

Feeds

12:33 PM

Q: What's the probability large cycles in the Collatz graph?

Definition: A Collatz-like graph is a directed graph, which contains one node for each natural number and a directed edge $(n, f(n))$ from $n$ to $f(n)$, where $f: \mathbb{N} \mapsto \mathbb{N}$ is a map for which it holds that on average $\frac{f(n)}{n} = \frac{3}{4}$. Observations: The Collatz...