Iskanje po repozitoriju

Opis: The present paper aims to investigate the factors that influence the achievements of Italian students on the National Mathematics Assessment INVALSI. The study is a quantitative non-experimental research and utilizes the Decision Tree Method (DTM), a data mining and machine learning approach, to analyze the relationships and interactions among the variables and their influence on students’ mathematics performance. The sample for the study consists of 15,344 grade-10 students who took the INVALSI test in the school year 2021/22. Findings show that school typology had the highest relative importance, followed by students’ school grades in mathematics, socioeconomic status, geographic macroregion, gender, age, and, finally, origin. Based on these results, policymakers and educators should prioritize interventions that enhance educational environments and individual academic proficiency, particularly focusing on school type, mathematics grades, and students’ ESCS, to improve student achievements and promote deeper learning.
Ključne besede: INVALSI, decision tree, cross-validation, mathematics
Objavljeno v RUP: 19.01.2026; Ogledov: 98; Prenosov: 9
Celotno besedilo (1,12 MB)
Gradivo ima več datotek! Več...

Opis: Inquiry-based learning (IBL) in mathematics is a student-centered approach that encourages exploration, problem-solving, and critical thinking, allowing students to actively engage with mathematical concepts and discover relationships through hands-on activities and collaborative learning. Despite the growing interest in IBL within mathematics education, which has demonstrated the efectiveness of this method on students’ achievements, less is known about its impact on Gagné’s taxonomy of knowledge (conceptual, procedural, and problem-solving knowledge). This study, based on Bruner’s instructional model, compares the efectiveness of IBL against traditional teaching methods in promoting mathematical learning across Gagné’s three taxonomies of knowledge in Grade 9 algebra content, using a sample of 258 Slovenian students (132 in the experimental group). Results show that the experimental group outperformed the control group in most areas, with no signifcant diference observed in procedural knowledge. The study suggests that IBL enhances students’ conceptual understanding and problem-solving abilities by fostering deeper engagement and critical thinking but may not have the same impact on procedural fuency, which requires repetitive practice.
Ključne besede: algebra, equations, inquiry-based learning, mathematics, problem-solving
Objavljeno v RUP: 04.07.2025; Ogledov: 881; Prenosov: 10
Celotno besedilo (1,09 MB)
Gradivo ima več datotek! Več...

Ključne besede: matematika, načrtovanje, matematična področja, prikriti kurikulum, matematične dejavnosti, mathematics, planning, mathematical fields, covert curriculum, mathematical activities
Objavljeno v RUP: 22.07.2020; Ogledov: 3308; Prenosov: 134
Celotno besedilo (519,09 KB)

Opis: It is shown that a minimal normal subgroup of a transitive permutation group of square-free degree in its induced action is simple and quasiprimitive, with three exceptions related to ▫$A_5$▫, ▫$A_7$▫, and PSL(2,29). Moreover, it is shown that a minimal normal subgroup of a 2-closed permutation group of square-free degree in its induced action is simple. As an almost immediate consequence, it follows that a 2-closed transitive permutation group of square-free degree contains a semiregular element of prime order, thus giving a partial affirmative answer to the conjecture that all 2-closed transitive permutation groups contain such an element (see [D. Marušic, On vertex symmetric digraphs,Discrete Math. 36 (1981) 69-81; P.J. Cameron (Ed.), Problems from the fifteenth British combinatorial conference, Discrete Math. 167/168 (1997) 605-615]).
Ključne besede: mathematics, graph theory, transitive permutation group, 2-closed group, square-free degree, semiregular automorphism, vertex-transitive graph
Objavljeno v RUP: 03.04.2017; Ogledov: 3961; Prenosov: 100
Povezava na celotno besedilo

Opis: An ▫$n$▫-bicirculantis a graph having an automorphism with two orbits of length ▫$n$▫ and no other orbits. This article deals with strongly regular bicirculants. It is known that for a nontrivial strongly regular ▫$n$▫-bicirculant, ▫$n$▫ odd, there exists a positive integer m such that ▫$n=2m^2+2m+1▫$. Only three nontrivial examples have been known previously, namely, for ▫$m=1,2$▫ and 4. Case ▫$m=1$▫ gives rise to the Petersen graph and its complement, while the graphs arising from cases ▫$m=2$▫ and ▫$m=4$▫ are associated with certain Steiner systems. Similarly, if ▫$n$▫ is even, then ▫$n=2m^2$▫ for some ▫$m \ge 2$▫. Apart from a pair of complementary strongly regular 8-bicirculants, no other example seems to be known. A necessary condition for the existence of a strongly regular vertex-transitive ▫$p$▫-bicirculant, ▫$p$▫ a prime, is obtained here. In addition, three new strongly regular bicirculants having 50, 82 and 122 vertices corresponding, respectively, to ▫$m=3,4$▫ and 5 above, are presented. These graphs are not associated with any Steiner system, and together with their complements form the first known pairs of complementary strongly regular bicirculants which are vertex-transitive but not edge-transitive.
Ključne besede: mathematics, graph theory, graph, circulant, bicirculant, automorphism group
Objavljeno v RUP: 03.04.2017; Ogledov: 11279; Prenosov: 99
Povezava na celotno besedilo