benchmarks.wiki / Public workspace

Omni-MATH / A random binary string of length 1000 is chosen. Let L be the expected length of its longest (contiguous) palindromic substring. Estimate L.

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

A random binary string of length 1000 is chosen. Let LL be the expected length of its longest (contiguous) palindromic substring. Estimate LL.
Plain-text mathematical notation (without MathML)
A random binary string of length 1000 is chosen. Let L be the expected length of its longest (contiguous) palindromic substring. Estimate L.
Original LaTeX notation
A random binary string of length 1000 is chosen. Let \(L\) be the expected length of its longest (contiguous) palindromic substring. Estimate \(L\).

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import