Python programming – Sieve of Eratosthenes – Mathematical Algorithms – Given a number n, print all primes smaller than or equal to n.For example, if n.
Mathematical Algorithms
45 Articles
45
Java programming – Sieve of Eratosthenes – Mathematical Algorithms – Given a number n, print all primes smaller than or equal to n.For example, if n is 10.
C programming – Sieve of Eratosthenes – Mathematical Algorithms – Given a number n, print all primes smaller than or equal to n. if n is 10, the output .
C Programming – Magic Square – Mathematical Algorithms – A magic square of order n is an arrangement of n^2 numbers, usually distinct integers, in a square.
C Programming Fibonacci numbers – Mathematical algorithms – The Fibonacci numbers are the numbers in the following integer sequence. 0, 1, 1, 2, 3, 5, 8, 13
C Programming-Print all combinations of points that can compose – Mathematical Algorithms -You can win three kinds of basketball points, 1 point, 2 points.
C Programming for Efficient way to multiply with 7 – Mathematical Algorithms – We can multiply a number by 7 using bitwise operator. left shift number by 3.
C programming for Write an Efficient Method to Check if a Number is Multiple of 3 – Mathematical Algorithms – If sum of digits in a number is multiple of 3.
JAVA Programming for Write a program to print all permutations of a given string – Mathematical Algorithms – A permutation also called “arrangement number”
C Programming – Babylonian method for square root – Mathematical Algorithms – If we are sure that n is a perfect square, then we can use following method.