RaindropA practical guide to choosing decision modelsGitHub ↗

Numerical cognition · question 7

Back to Numerical cognition · All capabilities

Question ID: mmlu/f5ccb2b0c61a00da265b
Source: MMLU
Input format: native choices

Explore this question’s altered versions

Question

Of the following, which gives the best upper bound for the value of f(N) where f is a solution to the recurrence f(2N + 1) = f(2N) = f(N) + log N for N >= 1, with f(1) = 0?

Answer choices

  • A: O(log N)
  • B: O(N log N)
  • C: O(log N) + 0(1)
  • D: O((log N)^2)

Reference answer: O((log N)^2) (D)

Exact evaluated input as JSON
{
  "state": "",
  "question": "Of the following, which gives the best upper bound for the value of f(N) where f is a solution to the recurrence f(2N + 1) = f(2N) = f(N) + log N for N >= 1, with f(1) = 0?",
  "choices": {
    "A": "O(log N)",
    "B": "O(N log N)",
    "C": "O(log N) + 0(1)",
    "D": "O((log N)^2)"
  }
}

Recorded model answers

Model Answer Outcome
Astra O((log N)^2) Correct
Opus 5.5 O((log N)^2) Correct
GLiDE v1.2 O((log N)^2) Correct
Decider v1.1 O((log N)^2) Correct
Jev O((log N)^2) Correct
Microsoft Decision-1 O((log N)^2) Correct
Clef O((log N)^2) Correct
Luna Decisions O((log N)^2) Correct
Clef Flash O((log N)^2) Correct
Strands Decider O((log N)^2) Correct
GLiNER2.5 Decide O(N log N) Incorrect
Laya O(log N) + 0(1) Incorrect
CalDec v1 O(log N) Incorrect

Source and sharing

Attribution: Dan Hendrycks et al.; MMLU authors.
Terms: MIT. Source sharing decision.
The capability assignment and choice-format normalization are part of this experiment. Source data retain their own terms.

Exact source locator and input fingerprint
{
  "source_locator": {
    "path": "all/test-00000-of-00001.parquet",
    "record": "1080",
    "kind": "source_file_record"
  },
  "source_revision": "c30699e8356da336a370243923dbaf21066bb9fe",
  "input_hash": "dde6991245197d625a61549f9ea2ccde1c0a1155351d6da775ad005748d326cd"
}

Type to search questions, variants and documentation.