bertrand_postulate_verify
Verify Bertrand's postulate for a given integer n by checking if there is at least one prime number between n and 2n.
Instructions
Verify Bertrand's postulate for given n. (Domain: arithmetic, Category: prime_conjectures)
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes |