Learn to Code and Code to Learn
Your Journey to Code Mastery
Example Input Input binary number: 00110111 Output Octal number: 67 Logic to convert Binary to Octal number system To make things simple and sound, I have divided the logic in two easy steps. Group all binary bits to 3 digits starting from right side. Write corresponding octal value for each grouped binary value. Binary to…
Read More “C program to convert Binary to Octal number system” »
Example Input Input number: 0011 Output Decimal: 3 Logic to convert binary to decimal number system Another approach using two’s complement
Example Input Input binary number: 01101110 Output Twos complement: 10010010 Twos complement of an <i>N</i>-bit number is defined as the complement with respect to 2<sup>N</sup>. It is the result of subtracting the number from 2<sup>N</sup>, which in binary is one followed by <i>N</i> zeroes. In simple words twos complement is defined as sum of ones complement of a binary number and…
Read More “C program to find twos complement of a binary number” »
Example Input Input binary number: 01000011 Output Ones complement: 10111100 Ones complement of a binary number is defined as value obtained by inverting all binary bits. It is the result of swapping all 1s to 0s and all 0s to 1s.
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” »