![]() Write a Java program to print all prime factors of a given number. ![]() Write a Java program to calculate e raise to the power x using sum of first n terms of Taylor Series. Write a Java program to calculate the Binomial Coefficient of two positive numbers. Write a Java program to compute the result from the innermost brackets. A fast scheme for evaluating a polynomial such as: Write a Java program to find next smallest palindrome. Write a Java program to find the number which has the maximum number of distinct prime factors in a given range. Write a Java program to print all primes smaller than or equal to any given number. In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. A square grid with n cells on each side is said to have order n.ΔΆ0. The sum is called the magic constant or magic sum of the magic square. , n 2 such that each cell contains a different integer and the sum of the integers in each row, column and diagonal is equal. In recreational mathematics and combinatorial design, a magic square is a n x n square grid (where n is the number of cells on each side) filled with distinct positive integers in the range 1, 2. Write a Java program to generate a magic square of order n (all row, column, and diagonal sums are equal). Write a Java program to count the numbers without digit 7, from 1 to a given number. Write a Java program to calculate and print average (or mean) of the stream of given numbers. Write a Java program to calculate power of a number without using multiplication(*) and division(/) operators. Write a Java program to multiply two integers without using multiplication, division, bitwise operators, and loops. Write a Java program to find the square root of a number using Babylonian method. Write a Java program to find the length of the longest sequence of zeros in binary representation of an integer. Write a Java program to count the number of prime numbers less than a given positive number. Write a Java program to accept two integers and return true if the either one is 15 or if their sum or difference is 15. Write a Java program to accept a float value of number and return a rounded float value. Write a Java program to convert a float value to absolute value. Write a Java program to convert an integer value to absolute value. Write a Java program to convert Roman number to an integer number. Write a Java program to reverse an integer number. Write a Java program to count the absolute distinct value in an array. Write a Java program to round a float number to specified decimals. Write a Java program to test if a double number is an integer. Write a Java program to get whole and fractional parts from a double value. Write a Java program to round up the result of integer division.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |