In this paper, we present SciTech, the summer international research program for talented high school students, organized in the Technion — Israel Institute of Technology [1]
The first author of this paper is proud of founding SciTech in 1992 when he was the head of the Harry and Lou Stern Family Science and Technology Youth Center at the Technion. Information on the various activities of the Youth Center aimed at promotion of excellence and interest in mathematics, science and technology of high school students can be found in the website of the Technion (http://www.mechina.technion.ac.il/en/index.html)
. Our major thesis is that while taking part in scientific projects under supervision by the Technion research stuff, the high school participants in SciTech are given the opportunity to work as researchers, and not just as learners. We begin with a brief discussion of the term ‘good research.’ This is followed by a description of SciTech: we outline how students are accepted to the program and what they do in it. The main part of this paper is devoted to discussion of some, not necessarily the most successful, mathematical projects, which we had the pleasure to supervise. We conclude the paper with general observations concerning the projects, based on our experience as SciTech mentors.
BrousseauG. (1997). ‘Foundations and methods of didactique.’ In Theory of didactical situations in mathematics (pp. 21–75.) Translated and edited by BalacheffN.CooperM.SutherlandR.WarfieldV.. Dordrecht: Kluwer.
KoichuB.BermanA. (2004). ‘3-D dynamic geometry: Ceva's theorem in space.’ International Journal of Computers for Mathematics Learning, 9(1), 95–108.
5.
KoichuB.BermanA. (2002). ‘Mathematical research work of talented high school students.’ In AndzarsA.MeissnerH. (Eds.) Proceedings of the 3rd International Conference “Creativity in Mathematics Education and the Education of Gifted Students” (pp. 43–50), Riga: University of Latvia.
6.
BermanA.GoldbergF. (2005). ‘Mathematical research experience of talented high school students in SciTech.’ In GagatsisA. (Ed.) Proceedings of the 4th Mediterranean Conference on Research in Math Education (pp. 561–570), Palermo.
7.
CozzensM.PorterR. (1985–1986). ‘HIMAP, Module 2: Recurrence Relations’COMAP, Inc.
8.
KoichuB. (1993). Modeling in the Elementary Mathematics (Ukrainian). Conspectus, 1, 46–57.
9.
CameronP.J.van LintJ.H. (1991). Designs, graphs, codes and their links, Cambridge University Press, 2nd ed.
10.
GrossB.H., (1974). ‘Intersection triangles and block intersection numbers of Steiner systems,’ Mathematische Zeitschrift, 139, 87–104.
11.
AlbertsonM.A.CollinsK.O.. (1996) ‘Symmetry breaking in graphs’Electronic Journal of Combinatorics, 3 (1), Research paper R18.
12.
TymoczkoJ. (2004). ‘Distinguishing numbers for graphs and groups,’ Electronic Journal of Combinatorics, 11(1), Research paper R63.
13.
GodsilC.RoyleG. (2001). ‘Algebraic Graph Theory,’ vol. 207 of Graduate Texts in Mathematics, Springer.
14.
GrahamR.L.GrötschelM.LovászL. (Eds.), (1995). Handbook of Combinatorics, 2 volumes, MIT Press.
