mca

Multiply Of Digit Program in Java

If a number=1234, then 1*2*3*4 ,Multiply of digit=24, Multiply Of Digit Program in Java

Least Common Multiple Program in Java

The least common multiple, lowest common multiple, or smallest common multiple of two integers a and b, usually denoted by LCM(a, b), is the smallest positive integer that is divisible by both a and b.

Harshad Number Program in Java

In mathematics, a harshad number (or Niven number) in a given number base is an integer that is divisible by the sum of its digits when written in that base.

Happy Number Program in Java

A happy number is a natural number in a given number base that eventually reaches 1 when iterated over the perfect digital invariant function for. Those numbers that do not end in 1 are -unhappy numbers.

Greatest Common Divisor Program in Java

the greatest common divisor (gcd) of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For example, the gcd of 8 and 12 is 4.

Floyd Triangle Program in Java

Floyd Triangle Program in Java 1
2 3
4 5 6
7 8 9 10
11 12 13 14 15

Fibonacci Series Program in Java

A series of numbers in which each number ( Fibonacci number ) is the sum of the two preceding numbers. The simplest is the series 0, 1, 1, 2, 3, 5, 8, etc.

Factors Program in Java

Factor a number or algebraic expression that divides another number or expression evenly—i.e., with no remainder. For example, 3 and 6 are factors of 12 because 12 ÷ 3 = 4 exactly and 12 ÷ 6 = 2 exactly. The other factors of 12 are 1, 2, 4, 6 and 12.
Factors of 12: 1, 2, 3, 4, 6, 12.

Factorial Program in Java

Factorial is the product of all positive integers less than or equal to n. Examples: 4! = 4 × 3 × 2 × 1 = 24

Duck Number Program in Java

A Duck number is a number which has zeroes present in it, but there should be no zero present in the beginning of the number. For example 3210

1 4 5 6 7 8 9