Skip to main content

Symbolic computation and dynamic geometry

2018/2019
Programme:
Mathematics Education
Year:
4 ali 5 year
Semester:
first
Kind:
mandatory
ECTS:
5
Language:
slovenian
Course director:

Prof. Dr. Marko Petkovšek

Lecturer (contact person):

Assist. Prof. Dr. Damjan Kobal, Prof. Dr. Marko Petkovšek

Hours per week – 1. semester:
Lectures
2
Seminar
0
Tutorial
0
Lab
2
Content (Syllabus outline)

Information and communication technology (ICT) in teaching and learning informatics, mathematics and natural science. Advantages and disadvantages. Impact of ICT on learning content, learning process and the development of logical thinking. Planning an efficient use of ICT.
Software for dynamic geometry. Interactive projections, transformations, and constructions. Automatic determination of geometric points. Experimental detection of geometric assumptions. Using symmetry. Analytic geometry. Graphical presentation.
Software for symbolic computation. Capabilities and limitations. Presentation and simplification of objects. Algebraic algorithms. Programming constructs. Knowledge representation. The graphics and sound. Workbooks. Preparation of educational materials. Computer-assisted self-assessment.

Readings

J. Boehm, I. Forbes, G. Herweyers, R. Hugelshofer, G. Schomacker: The Case for CAS. T3 Europe, 2004, ISBN 3-934064-45-0, 134 str. Dostopno na http://www.t3ww.com/pdf/TheCaseforCAS.pdf.
priročniki za sisteme za dinamično geometrijo
priročniki za sisteme simbolno računanje

Objectives and competences

The student is trained for independent and competent use of systems for symbolic computation and dynamic geometry in education and to critically assess the role of ICT in teaching informatics, mathematics and natural science.

Intended learning outcomes

Students learn:

  • basics of systems for symbolic computation and dynamic geometry
  • performances of systems for symbolic computations
Learning and teaching methods

lectures, exercises, homework, consultations.

Assessment

Homework, project
Written and/or oral exam.
grading: 5 (fail), 6-10 (pass) (according to the Statute of UL)

Lecturer's references

PETKOVŠEK, Marko, ZAKRAJŠEK, Helena. Enumeration of I-graphs: Burnside does it again. Ars mathematica contemporanea, ISSN 1855-3966. [Tiskana izd.], 2009, vol. 2, no. 2, str. 241-262. [COBISS-SI-ID 15497049]
PETKOVŠEK, Marko. Counting Young tableaux when rows are cosets. Ars combinatoria, ISSN 0381-7032, 1994, let. 37, str. 87-95. [COBISS-SI-ID 8048473]
PETKOVŠEK, Marko, WILF, Herbert S., ZEILBERGER, Doron. A=B. Wellesley (Massachusetts): A. K. Peters, cop. 1996. VII, 212 str. ISBN 1-56881-063-6. [COBISS-SI-ID 4085337]