Model Question Paper CST 292 Number Theory

 

Comments

Post a Comment

Popular posts from this blog

Number Theory CST 292 KTU IV Semester Honors Course Notes Dr Binu V P 9847390760

About me Syllabus Scheme Teaching Plan Model Question Paper University Question Papers Assignment-1 Module-1  Introduction Well ordering principle Group Ring Fields Group Ring Fields in detail Divisibility Modular Arithmetic GCD- Euclidean Algorithm Bezout's Identity Extended Euclidean Algorithm LCM-Least Common Multiple Linear Diophantine Equations Modular Division Module-II Prime Numbers and Prime-Power Factorisation Fermat and Mersenne Prime Primality Testing and Factorization Miller Rabin Primality Testing Algorithm Fermat  Factorization Congruence Modular Exponentiation Linear Congruences Simultaneous Linear Congruences- Chinese Remainder Theorem Fermat's Little Theorem and Euler's Theorem Wilson's Theorem Module-III Congruence with Prime modulus Congruence with Prime power modulus Pseudoprime and Carmichael Numbers Euler's Totient Function Cryptography The Group of Units - Primitive Roots Module-IV Quadratic Residues-Legendre and Jacobi Symbols Arithmetic Func...
Read more

Introduction

Welcome to the fascinating world of number theory! Number theory is a branch of pure mathematics that deals with the properties and relationships of numbers. It's one of the oldest branches of mathematics, dating back to ancient times, and it continues to be a vibrant and active field of research today. At its core, number theory focuses on the study of integers and their properties. Integers are whole numbers, including positive numbers, negative numbers, and zero. Number theorists explore various aspects of these integers, seeking patterns, relationships, and structures within the numerical realm. One of the central themes in number theory is prime numbers. Prime numbers are integers greater than 1 that have no positive divisors other than 1 and themselves. They play a fundamental role in number theory and are often considered the building blocks of the integers. The distribution and properties of prime numbers have intrigued mathematicians for centuries and continue to be a ...
Read more

Modular Arithmetic

Image
Modular arithmetic is a fascinating branch of mathematics that deals with numbers “wrapping around” when they reach a certain value, known as the modulus. Here are the key concepts: Definition: In modular arithmetic, we work with integers and consider their remainders when divided by a fixed quantity (the modulus). Think of it like a clock: after reaching 12 hours, the clock “wraps around” to 1. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss The Modulus If $a$  is an integer and $n$ is a positive integer, we define $ a \: mod \: n $ to be the remainder when $a$ is divided by $n$ . The integer is called the modulus. Thus, for any integer , $$a = qn+r \quad  0 \le r \lt n \quad q=\lfloor a/n \rfloor$$ $$r= a - \lfloor a/n \rfloor .n $$ Example: $11 \: \mod \: 7 =4$ and $-11 \: \mod  \: 7=3$ Two integers $a$ and $b$ are  said to congruent modulo  $n$, if $a \: \mod \: n= b \: \mod \: n$.This is written as $$a \equiv b (\mod...
Read more