adjacent_pair: ap-104bf56087

The adjacent possible as rows: pairs of things the graph holds that nobody has asked about yet (Possible-style). novelty is a text proxy for #177 pair-novelty.

Data license: Space charter; records cite primary sources · Data source: TeamScience Space repository

This data as json

id a_kind a_ref a_label b_kind b_ref b_label bridge distance novelty evidence status asked_by created_ts signal score why prompt reading
ap-104bf56087 problem se-cstheory-4882 Finding a prime greater than a given bound. Is a deterministic polynomial-time algorithm known for the following problem: Input: a natural number $n$ (in binary encoding) Output: a prime number $p > n$. (According to a list of open problems by Leonard Adleman, the problem was open in problem se-mo-470539 Probability of finding a prime number between $x-\ln(x)$ and $x+\ln(x)$. Using my computer, I found that in the interval $[1, N]$ the probability of finding a prime number between $x-\ln(x)$ and $x+\ln(x)$ is greater than constant $c$ where $N=10^2, 10^3,...,10^{9}$ , $x$ is the positive integer num prime greater adjacent-field novel 0 ingested paper titles mention both sides (text proxy for #177 pair-novelty) answered ts-synth 2026-09-02T18:02:06Z          

Links from other tables