Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
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

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...
An examination of PE student teachers’ and PE teachers’ experiences with and beliefs of teaching styles
An examination of PE student teachers’ and PE teachers’ experiences with and beliefs of teaching styles
Study 1 This study is aimed at examining physical education student teachers’ experiences with, beliefs about, and intention to use Spectrum teaching styles in the future (Mosston ...
The Mordell Conjecture
The Mordell Conjecture
The Mordell conjecture (Faltings's theorem) is one of the most important achievements in Diophantine geometry, stating that an algebraic curve of genus at least two has only finite...
A note on some polynomial-factorial Diophantine equations
A note on some polynomial-factorial Diophantine equations
In 1876 Brocard, and independently in 1913 Ramanujan, asked to find all integer solutions for the equation \(n!=x^2-1\). It is conjectured that this equation has only three solut...
Some necessary and sufficient conditions for diophantine graphs
Some necessary and sufficient conditions for diophantine graphs
A graph G of order n is called Diophantine if there exists a labeling function f of vertices such that gcd(f(u),f(v)) divides n for every pair adjacent vertices u,v in G. This pape...
The effect of different teaching models on improving nursing humanistic care competencies: a network meta-analysis
The effect of different teaching models on improving nursing humanistic care competencies: a network meta-analysis
ObjectivesTo evaluate the effectiveness of 13 teaching modes in improving nurses’ humanistic care ability using a Bayesian network meta-analysis.MethodsA computer-based search was ...

Back to Top