Javascript must be enabled to continue!
Teaching Congruences in Connection with Diophantine Equations
View through CrossRef
The presented paper is devoted to the new teaching model of congruences of computer science students within the subject of discrete mathematics at universities. The main goal was to create a new model of teaching congruences on the basis of their connection with Diophantine equations and subsequently to verify the effectiveness and efficiency of the proposed model experimentally. The teaching of congruences was realized in two phases: acquisition of procedural knowledge and use of Diophantine equations to obtain conceptual knowledge of congruences. Experiments confirmed that conceptual understanding of congruences is positively related to increasing the procedural fluidity of congruence resolution. Research also demonstrated the suitability of using Diophantine equations to link congruences and equations. Among other things, the presented research has confirmed the justification of teaching mathematics in computer-oriented study programs.
Title: Teaching Congruences in Connection with Diophantine Equations
Description:
The presented paper is devoted to the new teaching model of congruences of computer science students within the subject of discrete mathematics at universities.
The main goal was to create a new model of teaching congruences on the basis of their connection with Diophantine equations and subsequently to verify the effectiveness and efficiency of the proposed model experimentally.
The teaching of congruences was realized in two phases: acquisition of procedural knowledge and use of Diophantine equations to obtain conceptual knowledge of congruences.
Experiments confirmed that conceptual understanding of congruences is positively related to increasing the procedural fluidity of congruence resolution.
Research also demonstrated the suitability of using Diophantine equations to link congruences and equations.
Among other things, the presented research has confirmed the justification of teaching mathematics in computer-oriented study programs.
Related Results
Interactive Visualization of Line Congruences for Spatial Mechanism Design
Interactive Visualization of Line Congruences for Spatial Mechanism Design
This paper presents a framework for generating, representing, and interacting with the line congruences associated with four general finite poses. These line congruences are the so...
Developing Residents as Teachers: Process and Content
Developing Residents as Teachers: Process and Content
These data characterize and illuminate an analysis of experiences about teaching during each year of a pediatric residency training program in a tertiary care center. The curriculu...
Solving ????-unit, Mordell, Thue, Thue–Mahler and Generalized Ramanujan–Nagell Equations via the Shimura–Taniyama Conjecture
Solving ????-unit, Mordell, Thue, Thue–Mahler and Generalized Ramanujan–Nagell Equations via the Shimura–Taniyama Conjecture
In the first part we construct algorithms (over
Q
...
Congruences for hook lengths of partitions
Congruences for hook lengths of partitions
Recently, Amdeberhan
et al.
[Proc. Amer. Math. Soc. Ser. B 11 (2024), pp. 345–357] proved congruences for the number of hooks of fixed even ...
Teaching and Engaging International Students
Teaching and Engaging International Students
International student mobility has been increasingly subject to turbulences in politics, culture, economics, natural disasters, and public health. The new decade has witnessed an u...
EQUAÇÕES DIOFANTINAS: UM PROJETO PARA A SALA DE AULA E O USO DO GEOGEBRA
EQUAÇÕES DIOFANTINAS: UM PROJETO PARA A SALA DE AULA E O USO DO GEOGEBRA
http://dx.doi.org/10.5902/2179460X14629The study of Number Theory here in this article aims to study some properties of integer multiples or divisors, emphasizing issues related to...
Congruences for Fishburn numbers modulo prime powers
Congruences for Fishburn numbers modulo prime powers
The Fishburn numbers ξ(n) are defined by the formal power series [Formula: see text] Recently, Andrews and Sellers discovered congruences of the form ξ(pm + j) ≡ 0 modulo p, valid...
A New Proof of Smoryński’s Theorem
A New Proof of Smoryński’s Theorem
We prove: (1) the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable, (2) the set of all Diophantine...

