dor_id: 45311

506.#.#.a: Público

590.#.#.d: Los artículos enviados a la revista "Journal of Applied Research and Technology", se juzgan por medio de un proceso de revisión por pares

510.0.#.a: Scopus, Directory of Open Access Journals (DOAJ); Sistema Regional de Información en Línea para Revistas Científicas de América Latina, el Caribe, España y Portugal (Latindex); Indice de Revistas Latinoamericanas en Ciencias (Periódica); La Red de Revistas Científicas de América Latina y el Caribe, España y Portugal (Redalyc); Consejo Nacional de Ciencia y Tecnología (CONACyT); Google Scholar Citation

561.#.#.u: https://www.icat.unam.mx/

650.#.4.x: Ingenierías

336.#.#.b: article

336.#.#.3: Artículo de Investigación

336.#.#.a: Artículo

351.#.#.6: https://jart.icat.unam.mx/index.php/jart

351.#.#.b: Journal of Applied Research and Technology

351.#.#.a: Artículos

harvesting_group: RevistasUNAM

270.1.#.p: Revistas UNAM. Dirección General de Publicaciones y Fomento Editorial, UNAM en revistas@unam.mx

590.#.#.c: Open Journal Systems (OJS)

270.#.#.d: MX

270.1.#.d: México

590.#.#.b: Concentrador

883.#.#.u: https://revistas.unam.mx/catalogo/

883.#.#.a: Revistas UNAM

590.#.#.a: Coordinación de Difusión Cultural

883.#.#.1: https://www.publicaciones.unam.mx/

883.#.#.q: Dirección General de Publicaciones y Fomento Editorial

850.#.#.a: Universidad Nacional Autónoma de México

856.4.0.u: https://jart.icat.unam.mx/index.php/jart/article/view/606/602

100.1.#.a: Murray Lasso, M. A.

524.#.#.a: Murray Lasso, M. A. (2003). Math puzzles, powerful ideas, algorithms and computers in teaching problem-solving. Journal of Applied Research and Technology; Vol. 1 Núm. 03. Recuperado de https://repositorio.unam.mx/contenidos/45311

245.1.0.a: Math puzzles, powerful ideas, algorithms and computers in teaching problem-solving

502.#.#.c: Universidad Nacional Autónoma de México

561.1.#.a: Instituto de Ciencias Aplicadas y Tecnología, UNAM

264.#.0.c: 2003

264.#.1.c: 2003-10-01

653.#.#.a: Puzzles; Powerful Ideas; Algorithms; Computers; Problem-Solving; Paradigms; Graphs; States; Recursion; Shortest-Routes

506.1.#.a: La titularidad de los derechos patrimoniales de esta obra pertenece a las instituciones editoras. Su uso se rige por una licencia Creative Commons BY-NC-SA 4.0 Internacional, https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode.es, para un uso diferente consultar al responsable jurídico del repositorio por medio del correo electrónico gabriel.ascanio@icat.unam.mx

884.#.#.k: https://jart.icat.unam.mx/index.php/jart/article/view/606

001.#.#.#: 074.oai:ojs2.localhost:article/606

041.#.7.h: eng

520.3.#.a: With the current interest in teaching problem-solving, it is important that the example problems that are presented to students have important educational value. Many mathematical puzzles, while requiring little specific background to be posed and remembered, are paradigms of important practical problems. If the teacher chooses the right puzzles, he/she not only will have motivated the student"s interest, but will also have the opportunity of teaching powerful ideas that can be applied in a multitude of similar problems. Moreover the teacher will also be able to teach the corresponding solution algorithms and the way computers can be used as tools in problem-solving. The article presents these topics through an extensive example based on a well-known, apparently simple, wine-pouring puzzle that is intimately related to the concepts of state, shortest-routes and many management, engineering and industrial problems.

773.1.#.t: Journal of Applied Research and Technology; Vol. 1 Núm. 03

773.1.#.o: https://jart.icat.unam.mx/index.php/jart

022.#.#.a: ISSN electrónico: 2448-6736; ISSN: 1665-6423

310.#.#.a: Bimestral

264.#.1.b: Instituto de Ciencias Aplicadas y Tecnología, UNAM

doi: https://doi.org/10.22201/icat.16656423.2003.1.03.606

harvesting_date: 2023-11-08 13:10:00.0

856.#.0.q: application/pdf

245.1.0.b: Math puzzles, powerful ideas, algorithms and computers in teaching problem-solving

last_modified: 2024-03-19 14:00:00

license_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode.es

license_type: by-nc-sa

_deleted_conflicts: 2-ae6ca30a4d703cc788f086720564bf81

No entro en nada

No entro en nada 2

Artículo

Math puzzles, powerful ideas, algorithms and computers in teaching problem-solving

Murray Lasso, M. A.

Instituto de Ciencias Aplicadas y Tecnología, UNAM, publicado en Journal of Applied Research and Technology, y cosechado de Revistas UNAM

Licencia de uso

Procedencia del contenido

Cita

Murray Lasso, M. A. (2003). Math puzzles, powerful ideas, algorithms and computers in teaching problem-solving. Journal of Applied Research and Technology; Vol. 1 Núm. 03. Recuperado de https://repositorio.unam.mx/contenidos/45311

Descripción del recurso

Autor(es)
Murray Lasso, M. A.
Tipo
Artículo de Investigación
Área del conocimiento
Ingenierías
Título
Math puzzles, powerful ideas, algorithms and computers in teaching problem-solving
Fecha
2003-10-01
Resumen
With the current interest in teaching problem-solving, it is important that the example problems that are presented to students have important educational value. Many mathematical puzzles, while requiring little specific background to be posed and remembered, are paradigms of important practical problems. If the teacher chooses the right puzzles, he/she not only will have motivated the student"s interest, but will also have the opportunity of teaching powerful ideas that can be applied in a multitude of similar problems. Moreover the teacher will also be able to teach the corresponding solution algorithms and the way computers can be used as tools in problem-solving. The article presents these topics through an extensive example based on a well-known, apparently simple, wine-pouring puzzle that is intimately related to the concepts of state, shortest-routes and many management, engineering and industrial problems.
Tema
Puzzles; Powerful Ideas; Algorithms; Computers; Problem-Solving; Paradigms; Graphs; States; Recursion; Shortest-Routes
Idioma
eng
ISSN
ISSN electrónico: 2448-6736; ISSN: 1665-6423

Enlaces