Congruence Equations

Lecture Cryptography and network security: Chapter 9 after studying this section will help you understand: To introduce prime numbers and their applications in cryptography. To discuss some primality test algorithms and their efficiencies. To discuss factorization algorithms and their applications in cryptography.

50p hoathachthao090 10-02-2022 24 4   Download

In this paper, we prove the solutions of the exponential Diophantine equation 2x − 3y = z2 where x, y and z are non-negative integers. To find the solution, Catalan ’s conjecture and division algorithm congruence were applied. The result indicates that the equation has three solutions (x, y, z) including (0, 0, 0), (1, 0, 1) and (2, 1, 1).

4p trinhthamhodang9 10-12-2020 11 2   Download

Ce document est la premi`re partie d’un cours d’arithm´tique ´crit pour les ´l`ves pr´e e e ee e parant les olympiades internationales de math´matiques. Le plan complet de ce cours est : e 1. 2. 3. 4. 5. 6. 7. 8. Premiers concepts Division euclidienne et cons´quences e Congruences ´ Equations diophantiennes Structure de Z/nZ Sommes de carr´s e Polynˆmes ` coefficients entiers o a Fractions continues Cette premi`re partie traite les quatre premiers chapitres. Les quatre derniers chapitres e forment quant ` eux la deuxi`me partie de ce cours.

157p phuctran399 14-11-2010 213 98   Download