000 03090nam a22004335i 4500
999 _c387538
_d387538
001 387538
003 ES-MaUEC
005 20230322202345.0
006 a||||fo|||| 00| 0
007 cr nn 008mamaa
008 220601s2021 sz | s |||| 0|eng d
020 _a9783031024368
024 7 _a10.1007/978-3-031-02436-8
_2doi
040 _aES-MaUEC
_bspa
_cES-MaUEC
_dES-MaUEC
050 4 _aQA43
_b2021 EB
100 1 _aMcEachern, Andrew
_eautor
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_9687355
245 1 0 _aMathematical Problem Factories :
_bAlmost Endless Problem Generation
_cby Andrew McEachern, Daniel Ashlock
250 _a1st edition 2021
264 1 _aCham
_bSpringer International Publishing
_c2021
300 _a1 recurso en línea (XVII, 147 páginas)
336 _atexto
_btxt
_2rdacontent
337 _aelectrónico
_bc
_2rdamedia
338 _arecurso electrónico
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
490 0 _aSynthesis Lectures on Mathematics & Statistics
_x1938-1751
505 0 _aPreface -- Acknowledgments -- What Are Problem Factories? -- Sequence Extension Problems -- Basic Analytic Geometry Problems -- Problems Using Whole Numbers -- Diagrammatic Representations of Linear Systems -- Polyomino Tiling Puzzles -- Problems-Based on Graph Theory -- The Road Ahead: Other Problem Factories -- Authors' Biographies .
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.
988 _aSynthesis Collection of Technology_2021
650 7 _2embne
_9182517
_aMatemáticas
_xEstudio y enseñanza
650 7 _2embne
_9405008
_aMatemáticas
700 1 _aAshlock, Daniel
_eautor
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_9686297
776 0 8 _iPrinted edition:
_z9783031002823
776 0 8 _iPrinted edition:
_z9783031013089
776 0 8 _iPrinted edition:
_z9783031035647
856 4 0 _uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-02436-8
_zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942 _2lcc
_cLE
998 _b03/2023
_dz
_esc
_zSI