## How to generate Large Prime numbers for RSA Algorithm

The security of the RSA algorithm is based on the difficulty of factorizing very large numbers. The setup of an RSA cryptosystem involves the generation… Read More »

The security of the RSA algorithm is based on the difficulty of factorizing very large numbers. The setup of an RSA cryptosystem involves the generation… Read More »

Given a very large number N in form of string and a number K, the task is to print all the K-digit repeating numbers whose… Read More »

Given a very large number N, the task is to find the factorial of the number using Log. Factorial of a non-negative integer is the… Read More »

Given a large number in the form of a string N, the task is to check whether the number is divisible by 53 or not.… Read More »

Given a large number N, the task is to divide this number into a product of two factors, using Fermat’s Factorisation method. Examples Input: N… Read More »

The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then… Read More »

Given a number K of length N, the task is to find the smallest possible number that can be formed from K of N digits… Read More »

Given a large positive integer represented as a string str. The task is to round this number to the nearest multiple of 10. Examples: Input:… Read More »

Given a string str representing a large integer, the task is to find the result of N % 4. Examples: Input: N = 81 Output:… Read More »

Given a positive integer n, the task is to find the sum of the first n natural numbers given that n is very large (1… Read More »

Given a very large number in the form of a string, the task is to check if the number is divisible by 75 or not.… Read More »

Given a number, the task is to check if a number is divisible by 2, 3 and 5 or not. The input number may be… Read More »

Given a Number N, the task is to find the Remainder when N is divided by R (a two digit Number). The input of the… Read More »

Given a very large Number N. The task is to check if the number can be divided into two or more segments of an equal… Read More »

Given two numbers sa and sb represented as strings, find ab % MOD where MOD is 1e9 + 7. The numbers a and b can… Read More »