News for hackers. Stuff that matters.
Re:Mathematicians clear hurdle in quest to decode primes by ascar on Friday January 14, 2022 @06:47AM (#29933303)
> What Lindelof says is that the size of the output is always bounded by ε% as many digits as the input, for ANY (arbitrarily miniscule) ε > 0.

Is there are reason or benefit of stating it like that rather than saying the fraction of output and input digit size asymptotically approaches zero? Or did I misunderstand the explanation?

Re:Mathematicians clear hurdle in quest to decode primes by gavagai691 on Friday January 14, 2022 @11:08AM (#29936179)
Thinking about digit size is sort of fine for simplification / not turning off general audiences with equations, but a bit of a pain to think about if , e.g., the things you're comparing might be smaller than one.

What Lindelof says more precisely is that for any ε > 0 and any L-function L(s), there is a constant C_(ε,L) (depending only on ε and L, but crucially not on s) such that |L(s)| <= C_ε (1+|Im(s)|)^ε.

Re:Mathematicians clear hurdle in quest to decode primes by CrushItNerds519 on Friday January 14, 2022 @11:15AM (#29936304)
There may be some linguistic benefits to the "epsilon" formulation when discussing subconvexity rather than Lindelof. For instance, I think "the output is eventually bounded by 24% of the input" sounds more natural than "the limsup of output/input approaches something less than 24%".