Author: thecodepathshala

Example Input Input number: 371 Output 371 is armstrong number An Armstrong number is a n-digit number that is equal to the sum of the nth power of its digits. For example –6 = 61 = 6371 = 33 + 73 + 13 = 371

Example Input Input any number: 10 Output Prime factors of 10: 2, 5

Example Input Input lower limit: 1 Input upper limit: 20 Output Prime numbers between 1-20: 2, 3, 5, 7, 13, 17, 19 Program to print prime numbers in given range

Example Input Input any number: 17 Output 17 is prime number Prime numbers are the positive integers greater than 1 that is only divisible by 1 and self. For example: 2, 3, 5, 7, 11 etc…

Example Input Input number1: 12 Input number2: 30 Output LCM = 60 LCM is a smallest positive integer that exactly divides two or more numbers. For Example

Example Input Input first number: 12 Input second number: 30 Output HCF of 12 and 30: 6 HCF (Highest Common Factor) is the greatest number that divides exactly two or more numbers. HCF is also known as GCD (Greatest Common Divisor) or GCF (Greatest Common Factor).

Example Input Input number: 5 Output Factorial: 120

Example Input Input number: 12 Output Factors of 12: 1, 2, 3, 4, 6, 12

Example Input Input base: 2 Input exponent: 5 Output 2 ^ 5 = 32