Chinese Remainder Theorem

A 500-item BIG-bench task that asks for the unique integer satisfying three coprime remainder conditions, paraphrased as an English word problem.

Also known as: CRT, BIG-bench chinese_remainder_theorem

unassessed

This page is a discovery lead. Nobody has yet assessed it against the catalogue contract, so it carries no disposition. Absence of evidence here is not evidence of staleness.

Category	math
Subcategory	BIG-bench natural-language Chinese remainder theorem word problems (500 items)
Page status	unknown
Metric	exact_str_match
Direction	higher_is_better
Unit	%
Dataset size	500
Dataset licence	Apache-2.0
Publisher	Google (BIG-bench collaboration); authors at Stanford

What it measures

chinese_remainder_theorem asks for the number of objects in a container given three remainder conditions with coprime moduli, plus an upper bound. Chenlin Meng, Jiaming Song, and Stefano Ermon generate the systems from the Chinese remainder theorem so a solution exists and is unique, then paraphrase them with random containers, fruits, and agents. The work mixes reading the story with solving a modular system, not ordinary two-operand arithmetic.

Task format

Free-text integer. Preferred metric exact_str_match with output_regex [-+]?\d+. Canary GUID embedded.

Models reporting this benchmark

No model card in ModelSpec reports this benchmark yet.

Data

This page as JSON · Edit on GitHub