## Extended Euclidean algorithm Implementation in C, C++ and Python

The extended Euclidean algorithm is an extension to the Euclidean algorithm, which computes, besides the greatest common divisor of integers a and b, the coefficients of Bézout’s identity, that is integers x and y such that ax + by = gcd(a,b)

## Program to find generators of cyclic group

Write a C/C++ program to find generators of cyclic group.   A cyclic group is a group that is generated by a single element. That means that there exists an element g, say, such that every other element of the group can be written as a power of g. This element g is the generator …

## Chinese Remainder Theorem

Write a C/C++ program to solve given simultaneous pairs of Linear Congruence Equations using Chinese remainder theorem.

## Find general solution to given Linear Congruence Equation

Write a C/C++ program to find general solution to given Linear Congruence Equation.

## Solve Simultaneous Pairs of Linear Congruence Equations

Write a C/C++ program to solve given simultaneous pairs of Linear Congruence Equations.

## Get an Iterator over a primitive array in Java

In this post, we will see how to get an iterator over a primitive array in Java. The iterator should be able to iterate over the values in the specified array.

## Find general solution of Linear Diophantine equation

Write a C/C++ program to find general solution of Linear Diophantine equation. A linear Diophantine equation is a first degree (linear) polynomial whose solutions are restricted to integers.

## 3-partition problem extended | Print all partitions

Given an array of positive integers which can be partitioned into three disjoint subsets having same sum and that covers S, print the partitions.

## Vigenère Cipher Implementation

The Vigenère cipher is a form of polyalphabetic substitution to encrypt alphabetic text by using a keyword. The Vigenère cipher is easy to understand and implement. It consists of several Caesar ciphers in sequence with different shift values.

## C program to demonstrate Diffie-Hellman algorithm

Diffie-Hellman algorithm is used to establish a shared secret between two parties which can be used for secret communication for exchanging data over a public network.

## Euclid’s Algorithm to find GCD of two numbers

The Euclid’s algorithm (or Euclidean Algorithm) is a method for efficiently finding the greatest common divisor (GCD) of two numbers. The GCD of two integers X and Y is the largest number that divides both of X and Y (without leaving a remainder).

## Recursive Program to Calculate Factorial of a Number

Write a recursive C/C++ and java program to calculate factorial of a given positive number.   The factorial of a non-negative integer n is the product of all positive integers less than or equal to n. It is denoted by n!. There are n! different ways to arrange n distinct objects into a sequence.