Claims

Arithmetic problem difficulty may increase as the square of the number of steps rather than directly with step count

Claim · All claims
Evidence · 1 study · theoretical r2 · q1
Currency · newest study 1913 · not yet checked against its sources · not reviewed by a person

Subclaims

Reading the evidence codes

q is the design tier, i the impact, n the sample, and the kind with its r the rigour judged within that kind: what each code means.

This claim: no standardized effect is recorded in observations/ for it yet, so no benchmark reading is possible.

q1 i? Problem difficulty in arithmetic may increase directly as the square of the number of steps, a more probable hypothesis than difficulty rising directly with step count. → Locke 1913

Evidence

Locke 1913

Locke, L. L. (1913). Inspector Winch's experiments on transfer. https://www.google.com/books/search?q=%22Inspector+Winch%27s+Experiments+on+Transfer%22

q1 · i? · theoretical · r2

Tentative hypothesis offered in the commentary's discussion of the weighting of steps in problem work; no data are reported. The author proposes that 'the increase is directly as the square of the number of steps.'

"Problems do not increase in difficulty directly as the number of steps increases. It might be assumed as a more probable hypothesis thai the increase is directly as the square of the number of steps."

Discussion

Page metadata
Field Value
type claim
id problem-difficulty-square-of-steps
title Arithmetic problem difficulty may increase as the square of the number of steps rather than directly with step count
description Arithmetic problem difficulty may increase as the square of the number of steps rather than directly with step count
status review
evidence_strength weak
newest_evidence 1913
generated by process:wiki-ingest on 2026-10-24
trust unverified — no one has confirmed this page's content
sources 1 — locke-1913

Frontmatter is the page's machine-readable record — see the Schema & Guide.