{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"boolq","formal_name":"BoolQ","introduction":"BoolQ pairs naturally occurring yes/no questions from search queries with a passage that decides them. The format is simple, but the inference it needs is consistently heavier than it looks.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/google-research-datasets/boolean-questions","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"eb1e9c3c-04de-5b12-9c69-bc1269ec826e","task_key":"default--validation--eb1e9c3c-04de-5b12-9c69-bc1269ec826e","task_revision_id":"1","upstream_id":"","short_description":"is a divisor the same as a factor","config":"default","split":"validation","body":"{\"passage\":\"In mathematics, a divisor of an integer n (\\\\displaystyle n) , also called a factor of n (\\\\displaystyle n) , is an integer m (\\\\displaystyle m) that may be multiplied by some integer to produce n (\\\\displaystyle n) . In this case, one also says that n (\\\\displaystyle n) is a multiple of m . (\\\\displaystyle m.) An integer n (\\\\displaystyle n) is divisible by another integer m (\\\\displaystyle m) if m (\\\\displaystyle m) is a divisor of n (\\\\displaystyle n) ; this implies dividing n (\\\\displaystyle n) by m (\\\\displaystyle m) leaves no remainder.\",\"question\":\"is a divisor the same as a factor\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/google-research-datasets/boolean-questions","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}