Skip to main content

Basic Modular Arithmetic

In simple terms, Modular Arithmetic calculates the remainder of anything divided by anything. The later is called modulus. e.g. ( 15 / 7 ) Quotient: 2, Remainder 1. 

In greater sense, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" upon reaching a certain value—the modulus ( src: Wikipedia ).
Take a look at hour clock. After 12:59 pm, we say 1:00 pm, because we modulo the hours by 12. 13 pm % 12 is 1 pm. (%) represents modulus operator.
Examples: 5 % 2 = 1, 14458948 % 25 = 23

a≡b (mod n)
This says that a is congruent to b modulo n. It means both a and b has same remainder when divided by n. e.g. 38≡14 (mod 12)

Commonly Used Properties:
  • Reflexivity: a ≡ a (mod n)
  • Symmetry: a ≡ b (mod n) if and only if b ≡ a (mod n)
  • Transitivity: If a ≡ b (mod n) and b ≡ c (mod n), then a ≡ c (mod n)
  • If a1 ≡ b1 (mod n) and a2 ≡ b2 (mod n), or if a ≡ b (mod n), then:a + k ≡ b + k (mod n) for any integer k (compatibility with translation)
  • k a ≡ k b (mod n) for any integer k (compatibility with scaling)
  • a1 + a2 ≡ b1 + b2 (mod n) (compatibility with addition)
  • a1 – a2 ≡ b1 – b2 (mod n) (compatibility with subtraction)
  • a1 a2 ≡ b1 b2 (mod n) (compatibility with multiplication)
  • ak ≡ bk (mod n) for any non-negative integer k (compatibility with exponentiation)
Simple C program to perform Modulo:

In CS, modular arithmetic is used in many algorithms where integers become too big to handle.

For more details:

 modulo C.

Comments

Popular posts from this blog

SPOJ - GSS1

Considering input series: { 4 , -10 , 3 , 100 , -20 , 1 } Query(x,y) = Max { a[i]+a[i+1]+...+a[j] ; x ≤ i ≤ j ≤ y } A node contains-  [ START & END is a node's segment limit ] Prefix is the maximum sum starting at START, end can be anywhere. There are two possibilities of the maximum. One, node's leftChild's prefix or two, adding leftChild's sum + rightChild's prefix. (which will make the prefix contiguous) Suffix is the maximum sum ending at END, start can be anywhere. There's two possibility of the maximum. One, node's rightChild's already calculated suffix or two, add rightChild's sum + leftChild's suffix   (which will make the suffix contiguous). Sum : leftChild's sum + rightChild's sum. MAX Maximum of  -  prefix (result is in the node, starts from START but doesn't end in END ) suffix  (result is in the node, doesn't start from START but surely ends in END ) leftChild's max ( result is in left ...

Bitwise Sieve w/ code sample

Sieve of Eratosthenes is explained HERE Bitwise sieve is an optimized implementation of  Sieve of Eratosthenes. It does the same thing but more memory efficient because it uses logic operations( &,|,>>,<< ) on binary numbers. In normal implementation, we use an array as flag to check if a number is prime or not.we know index of an array ( i.e  myarray[n]  ) is 32 bit long. If an array is 10 index long, that it has 32x10(=320) bits.  We use bits of that array as flag. that way we can flag numbers upto 320 as prime or not prime. i.e, how to check the flag status of 51 in myarray[ n ] ? We'll divide 5 by 32, that will give us the index number of the certain bit, then we'll mod 5 by 32, that will give us the certain bit position to check for 0 or 1. Remember bit positions are defined from right to left, starting from 0. Meaning LST = 0 and MST = 31. So we need to define two functions, one to set that certain bit as 0 or 1, another to check if...

SPOJ 5 - PALIN

Problem Statement Explanation is here Sample Solution : #include<bits/stdc++.h> using namespace std; char k[1000005]; int l,i,j,mid; bool chkNine() {     cout<<""; //for SPOJ's internal problem, this line is needed     for(i=0;i<l;i++)     {         if( k[i]!='9' ) return false;     } } void nextPalin() {     int f=0;     l=strlen(k);     if(chkNine()) {         memset(k,'0',l);         k[0] ='1';         k[l]='1';         k[l+1]='\0';         return;     }     // calc mid,i,j     if(l%2==0)     {         i= ( l/2 )-1;      ...