In this blog post, we learn how to write a C program to print natural numbers from 1 to n.  We will take the help of iterative statements like for, while or do-while loop to print natural numbers in reverse. What are Natural numbers? Natural numbers are the positive integers or non-negative integers which starts […]

In this blog post, we learn C Program to find the sum of odd natural numbers from 1 to n. We will take the help of iterative statements like for, while or do-while loop to find the sum of odd numbers from 1 to n.   What are Natural numbers? Natural numbers are the positive

In this blog post, we learn how to write a C Program to find the sum of natural numbers upto n.  We will take the help of iterative statements like for, while or do-while loop to find the SUM of the natural numbers.   What are Natural numbers? Natural numbers are the positive integers or

In this blog post, we learn C Program to find the sum of even numbers from 1 to n.  We will take the help of iterative statements like for, while or do-while loop to find the sum of even numbers from 1 to n.   What are Natural numbers? Natural numbers are the positive integers

What are Natural numbers? Natural numbers are the positive integers or non-negative integers which starts from 1 and ends at infinity, such as: 1,2,3,4,5,6,7,8,9,10,……,∞   In this blog post, we learn how to write a C program to print natural numbers from 1 to n.  We will take the help of iterative statements like for,

What are Armstrong numbers? A positive integer number of n digits is called an Armstrong number of order n (order is a number of digits) if the sum of the power of n of each digit is equal to the number itself. For example, abcd… = pow(a,n) + pow(b,n) + pow(c,n) + pow(d,n) + ….   Common

What are Armstrong numbers? An Armstrong number is a 3-digit number such that the sum of the cube of each of its digits is equal to the number itself. For example, 371 is an Armstrong number since 3**3 + 7**3 + 1**3 = 371.   In general, a positive integer number of n digits is

What is the Fibonacci sequence? In the Fibonacci series, each number is the sum of the two previous numbers. The first two numbers in the Fibonacci series are 0 and 1. The sequence Fn of Fibonacci numbers is defined by the recurrence relation: Fn = Fn-1 + Fn-2 ( where, n > 1) with seed

What is the Fibonacci sequence? In the Fibonacci series, each number is the sum of the two previous numbers. The first two numbers in the Fibonacci series are 0 and 1. The sequence Fn of Fibonacci numbers is defined by the recurrence relation: Fn = Fn-1 + Fn-2  ( where, n > 1) with seed

How to write a C Program to Find Prime Factors of a Number using For Loop, While Loop, and Functions. In our previous article, we have already explained, How to write a program to Find Factors of a Number and Find Prime numbers. C Program to Find Prime Factors of a Number Using While Loop