000			a
999			_c33329 _d33329
008			241106b xxu||||| |||| 00| 0 eng d
020			_a9783031013089
082			_a510.71 _bMCE
100			_aMcEachern, Andrew
245			_aMathematical problem factories : almost endless problem generation
260			_bSpringer, _c2022 _aSwitzerland :
300			_axvii, 147 p. ; _bill., _c24 cm.
365			_b1944.00 _c₹ _d01
490			_aSynthesis Lectures on Mathematics and Statistics
520			_aA problem factory consists of a traditional mathematical analysis of a type of problem that describes many, ideally all, ways that the problems of that type can be cast in a fashion that allows teachers or parents to generate problems for enrichment exercises, tests, and classwork. Some problem factories are easier than others for a teacher or parent to apply, so we also include banks of example problems for users. This text goes through the definition of a problem factory in detail and works through many examples of problem factories. It gives banks of questions generated using each of the examples of problem factories, both the easy ones and the hard ones. This text looks at sequence extension problems (what number comes next?), basic analytic geometry, problems on whole numbers, diagrammatic representations of systems of equations, domino tiling puzzles, and puzzles based on combinatorial graphs. The final chapter previews other possible problem factories.
650			_aBinomial coefficients
650			_aComplete bipartite graph
650			_aContact network
650			_aDot product
650			_aFinite difference
650			_aGraph theory
650			_aPascal's Triangle
650			_aL-tromino
650			_aRaveling salesman problem
700			_aAshlock, Daniel
942			_2ddc _cBK