Author: thecodepathshala

Example Input Input number of terms: 10 Output Fibonacci series: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34 Fibonacci series is a series of numbers where the current number is the sum of previous two terms. For Example: 0, 1, 1, 2, 3, 5, 8, 13, 21, … , (n-1th + n-2th) Program to…

Read More “C program to print fibonacci series upto n terms” »

Example Input Input upper limit: 1000 Output Strong numbers between 1-1000: 1, 2, 145 Strong number is a special number whose sum of factorial of digits is equal to the original number. For example: 145 is strong number. Since, 1! + 4! + 5! = 145 Program to print strong numbers in given range

Example Input Input number: 145 Output 145 is STRONG NUMBER Strong number is a special number whose sum of factorial of digits is equal to the original number.For example: 145 is strong number. Since, 1! + 4! + 5! = 145

Example Input Input upper limit: 100 Output Perfect numbers between 1 to 100: 6, 28 Perfect number is a positive integer which is equal to the sum of its proper positive divisors. For example: 6 is the first perfect numberProper divisors of 6 are 1, 2, 3Sum of its proper divisors = 1 + 2 +…

Read More “C program to find perfect numbers between 1 to n” »

Example Input Input any number: 6 Output 6 is PERFECT NUMBER Perfect number is a positive integer which is equal to the sum of its proper positive divisors.For example: 6 is the first perfect numberProper divisors of 6 are 1, 2, 3Sum of its proper divisors = 1 + 2 + 3 = 6.Hence 6 is…

Read More “C program to check whether a number is perfect number or not” »

Example Input Enter lower limit: 1 Enter upper limit: 1000 Output Armstrong number between 1 to 1000 are: 1, 2, 3, 4, 5, 6, 7, 8, 9, 370, 371, 407 An Armstrong number is a n-digit number that is equal to the sum of nth power of its digits. For example,6 = 61 = 6371 = 33 + 73 + 13 = 371 Program…

Read More “C program to find Armstrong numbers between 1 to n” »

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…