With the help of the C programming language, we can solve various types of mathematical problems.In this tutorial, we are going to write some programs in C to solve mathematical problems like Fibonacci Series, Prime Numbers, Palindrome and Factorial of a number, Reverse of a number, Matrix multiplication and decimal to binary.<\/p>\n
In the Fibonacci series, the next number is the sum of the previous two numbers. And the first two numbers of the fibonacci series are 0 and 1.<\/p>\n
Example:- 0,1,1,2,3,5,8,13 etc.<\/strong><\/p>\n In two ways, you can implement fibonacci series:-<\/p>\n START You can implement fibonacci series without recursion in C. Below is the code to perform fibonacci series without recursion:-<\/p>\n Output:-<\/strong><\/p>\n With the help of recursion, you can implement the fibonacci series in C. Below is the code to perform fibonacci series with recursion:-<\/p>\n Output:-<\/strong><\/p>\n TechVidvan Tutorial: Fibonacci Series with Recursion in C!<\/p>\n Fibonacci Series: 0 1 1 2 3 5 8<\/p>\n<\/div>\n When a number is just divisible by 1 or itself and is greater than 1 is called a prime number.<\/p>\n NOTE:-<\/strong> Prime numbers are divisible by 1 or itself.<\/p>\n Example:- 2,3,5,7,11,13 etc are prime numbers.<\/p>\n C Program to Check if a number is prime or not<\/strong><\/p>\n Output:-<\/strong><\/p>\n TechVidvan Tutorial: Check if a number is prime or not!<\/p>\n Check this number: Suppose, a number is reversed. If the reversed number is the same as the original number then this number is called a palindrome number.<\/p>\n Example:- Palindrome Number<\/strong><\/p>\n Output:-<\/strong><\/p>\n Factorial of a number means the product of all positive descending integers. Factorial is denoted by \u2018!\u2019. There are 2 ways to write the program for finding the factorial of a number.<\/p>\n In C, you make use of loops to find the factorial of a number.<\/p>\n Output:-<\/strong><\/p>\n In C, you also calculate the factorial of a number using recursion.<\/p>\n Output:-<\/strong><\/p>\n In C, there are many ways to reverse a number. You can reverse a number using loops and recursion.<\/p>\n You have to use modulus(%) to reverse a number.<\/p>\n Following is the code to reverse a number using a while loop.<\/p>\n Output:-<\/strong><\/p>\n Following is the program to reverse a number using recursion:-<\/p>\n Output:-<\/strong><\/p>\n TechVidvan Tutorial: Reverse a number using recursion!<\/p>\n Please enter a number to reverse:236498 In this, we first initialised and declared variables. Then, we put the condition in the program. If the condition is true then the code within the for block will get executed. And if it is false then it will exit out of the for block. After that the increment statement will get executed. Then, the condition will be checked. If it is true then the for block will execute again.<\/p>\n Output:-<\/strong><\/p>\n TechVidvan Tutorial: Reverse a number using the for loop!<\/p>\n Enter a number to reverse: 3664921 It is much like the while loop. But it gets executed at least one time in the do-while loop. Output:-<\/strong><\/p>\n TechVidvan Tutorial: Reverse a number using a do-while loop!<\/p>\n Enter a number to reverse: 23645869 In C, we can add, subtract, multiply one, two or three dimensional matrices. To do these operations, you have to take input from the user for row number, column number and matrix elements. After that, you can perform matrix multiplication.<\/p>\n Following is an example of multiplying of 2*2 and 3*3 matrices:-<\/p>\n Output:-<\/strong><\/p>\n TechVidvan Tutorial: Multiplying matrices in C!<\/p>\n Please enter the number of rows: 2 In C, you can convert a decimal value to a binary value or vice-versa.<\/p>\n It is specially known as a base 10 number. It ranges from 0 to 9.<\/p>\n Example:- 23, 6,78,90 etc.<\/p>\n Decimals are also defined as a combination of digits.<\/p>\n It is either 1 or 0. It is a base 2 number. Combination of 0 and 1\u2019s such as 001,110,1110 etc. Example:- Converting decimal to binary<\/strong><\/p>\n Output:-<\/strong><\/p>\n TechVidvan Tutorial: Converting decimal to binary in C!<\/p>\n Please enter the number which you want to convert: 12 In this tutorial, we perform some mathematical operations using loops, recursion etc. We wrote a program to convert a decimal number to a binary number and performed multiplication on matrices. We wrote a program to find the factorial of a number in C. Then we also wrote programs to reverse a number, find the palindrome of a number, check if the number is prime or not. We discussed how we can implement the fibonacci series in C.<\/p>\n","protected":false},"excerpt":{"rendered":" With the help of the C programming language, we can solve various types of mathematical problems.In this tutorial, we are going to write some programs in C to solve mathematical problems like Fibonacci Series,...<\/p>\n","protected":false},"author":1,"featured_media":83442,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3510],"tags":[3951,3952,3953,3954,3955,3956,3957],"class_list":["post-83386","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-c-programming","tag-c-programs","tag-factorial-of-number-in-c","tag-fibonacci-series-in-c","tag-important-c-programs","tag-palindrome-program-in-c","tag-prime-numbers-in-c","tag-programs-in-c"],"yoast_head":"\n\n
Algorithm:-<\/h4>\n
\nStep 1 \u2192 Take integer variable n1, n2, n3
\nStep 2 \u2192 Set n1 = 0, n2 = 0
\nStep 3 \u2192 DISPLAY n1, n2
\nStep 4 \u2192 n3 = n1 + n2
\nStep 5 \u2192 DISPLAY n3
\nStep 6 \u2192 Set n1 = n2, n2 = n3
\nStep 7 \u2192 REPEAT from 4 – 6, for n times
\nSTOP<\/p>\nFibonacci Series Without recursion in C:-<\/h4>\n
#include<stdio.h> \nint main() \n{ \nint first=0,second=1,result,a,num=7;\nprintf(\"TechVidvan Tutorial: Fibonacci Series without recursion!\\n\");\nprintf(\"%d %d\",first,second); \nfor(a=2;a<num;++a) \n{ \nresult=first+second; \nprintf(\" %d\",result); \nfirst=second; \nsecond=result; \n} \nreturn 0; \n}\n<\/pre>\n
\n0 1 1 2 3 5 8<\/div>\nFibonacci Series with recursion in C:-<\/h4>\n
#include<stdio.h> \nvoid fib(int num){ \nstatic int first=0,second=1,result; \nif(num>0){ \nresult=first+second; \nfirst=second; \nsecond=result; \nprintf(\"%d \",result); \nfib(num-1); \n} \n} \nint main(){ \nint num=7; \nprintf(\"TechVidvan Tutorial: Fibonacci Series with Recursion in C!\\n\\n\");\nprintf(\"Fibonacci Series: \"); \nprintf(\"%d %d \",0,1); \nfib(num-2); \nreturn 0; \n}\n<\/pre>\n2. Find Prime Numbers in C Program:-<\/h3>\n
#include<stdio.h> \nint main(){ \nint num,a,res=0,count=0; \nprintf(\"TechVidvan Tutorial: Check if a number is prime or not!\\n\\n\");\nprintf(\"Check this number: \\n\"); \nscanf(\"%d\",&num); \nres=num\/2; \nfor(a=2;a<=res;a++) \n{ \nif(num%a==0) \n{ \nprintf(\"The entered number '%d' is not prime!\",num); \ncount=1; \nbreak;\t \n} \n} \nif(count==0) \nprintf(\"The entered number '%d' is prime!\",num);\t \nreturn 0; \n}\t\n<\/pre>\n
\n23
\nThe entered number ’23’ is prime!<\/p>\n<\/div>\n3. Find if the number is Palindrome using C Programming<\/h3>\n
Algorithm:-<\/h4>\n
\n
#include<stdio.h> \nint main() \n{ \nint num,reversed,sum=0,garbage;\nprintf(\"TechVidvan Tutorial: Palindrome number!\\n\");\nprintf(\"Please enter your number: \"); \nscanf(\"%d\",&num); \ngarbage=num; \nwhile(num>0) \n{ \nreversed=num%10; \nsum=(sum*10)+reversed; \nnum=num\/10; \n} \nif(garbage==sum) \nprintf(\"The entered number '%d' is palindrome!\",garbage); \nelse \nprintf(\"The entered number '%d' is not palindrome!\",garbage); \nreturn 0; \n}\n\n<\/pre>\n
\nPlease enter your number: 131
\nThe entered number ‘131’ is palindrome!<\/div>\n4. Find Factorial of a number through C Program<\/h3>\n
\nExample:-<\/p>\n5! = 5*4*3*2*1 = 120\n4! = 4*3*2*1 = 24<\/pre>\n
\n
Find factorial of a number using loop:-<\/h4>\n
#include<stdio.h> \nint main() \n{ \n int a,factorial=1,num;\n printf(\"TechVidvan Tutorial: Find the factorial of a number using a loop!\\n\");\n printf(\"Please enter the number: \"); \n scanf(\"%d\",&num); \n for(a=1;a<=num;a++){ \n \tfactorial=factorial*a; \n } \n printf(\"The factorial value of %d is: %d\",num,factorial); \nreturn 0; \n}<\/pre>\n
\nPlease enter the number: 5
\nThe factorial value of 5 is: 120<\/div>\nFind factorial of a number using recursion:-<\/h4>\n
#include<stdio.h> \nint fact(int num) \n{ \n if (num == 0) \n return 1; \n else \n return(num * fact(num-1)); \n} \n \nint main() \n{ \n int num; \n int factorial;\n printf(\"TechVidvan Tutorial: Finding the factorial of a number using recursion!\\n\");\n printf(\"Please enter a number: \"); \n scanf(\"%d\", &num); \n \n factorial = fact(num);\n printf(\"The factorial value of %d is %d\\n\", num, factorial); \n return 0; \n}\n\n<\/pre>\n
\nPlease enter a number: 5
\nThe factorial value of 5 is 120<\/div>\n5. Reverse a number using C:-<\/h3>\n
Algorithm:-<\/h4>\n
\n
Reverse a number using while loop:-<\/h4>\n
#include<stdio.h>\n#include<conio.h>\nint main()\n{\nint num, reverse = 0;\nprintf(\"TechVidvan Tutorial: Reverse a number using the while loop!\\n\");\nprintf(\"Enter a number to reverse: \");\nscanf(\"%d\", &num);\nwhile (num != 0)\n{\nreverse = reverse * 10;\nreverse = reverse + num % 10;\nnum = num \/ 10;\n}\nprintf(\"The reverse value of the entered number is: %d\", reverse);\nreturn 0;\n}\n<\/pre>\n
\nEnter a number to reverse: 22114456
\nThe reverse value of the entered number is: 65441122<\/div>\nReverse a number using recursion:-<\/h4>\n
#include<stdio.h>\n#include<conio.h>\nint reverse_number(int);\nint main()\n{\nint num, reverse = 0;\nprintf(\"TechVidvan Tutorial: Reverse a number using recursion!\\n\\n\");\nprintf(\"Please enter a number to reverse:\");\nscanf(\"%d\", &num);\nreverse = reverse_number(num);\nprintf(\"The reverse value of the number is: %d\", reverse);\nreturn 0;\n}\nreverse_number(int num)\n{\nstatic reverse = 0;\nif (num == 0)\nreturn 0;\nreverse = reverse * 10;\nreverse = reverse + num % 10;\nreverse_number(num\/10);\nreturn reverse;\n}\n<\/pre>\n
\nThe reverse value of the number is: 894632<\/p>\n<\/div>\nReverse a number using for loop:-<\/h4>\n
#include<stdio.h>\n#include<conio.h>\nint main()\n{\nint num, remain, reverse=0, a;\nprintf(\"TechVidvan Tutorial: Reverse a number using the for loop!\\n\\n\");\nprintf(\"Enter a number to reverse: \");\nscanf(\"%d\", &num);\nfor(a = num; a >0; )\n{\nremain = a % 10;\nreverse = remain + reverse * 10;\na = a\/ 10;\n}\nprintf(\"The reverse value of the entered number is: %d\", reverse);\nreturn 0;\n}\n<\/pre>\n
\nThe reverse value of the entered number is: 1294663<\/p>\n<\/div>\nReverse a number using do-while loop:-<\/h4>\n
\nThe condition is set to at the end of the loop. And the statements inside the do-while loop gets executed before checking if the condition is true or false.<\/p>\n#include<stdio.h>\n#include<conio.h>\nint main()`\n{\nint num, reverse = 0;\nprintf(\"TechVidvan Tutorial: Reverse a number using a do-while loop!\\n\\n\");\nprintf(\"Enter a number to reverse: \");\nscanf(\"%d\", &num);\ndo\n{\nreverse = reverse * 10;\nreverse = reverse + num % 10;\nnum = num \/ 10;\n}while(num != 0);\nprintf(\"The reverse value of the number is: %d\", reverse);\nreturn 0;\n}\n<\/pre>\n
\nThe reverse value of the number is: 96854632<\/p>\n<\/div>\n6. Matrix Multiplication using C Language<\/h3>\n
#include<stdio.h> \n#include<stdlib.h> \nint main(){ \nint m1[10][10],m2[10][10],multiple[10][10],row,column,a,b,c; \nprintf(\"TechVidvan Tutorial: Multiplying matrices in C!\\n\\n\");\nprintf(\"Please enter the number of rows: \"); \nscanf(\"%d\",&row); \nprintf(\"Please enter the number of columns: \"); \nscanf(\"%d\",&column); \nprintf(\"Please enter the elements of first matrix:\\n\"); \nfor(a=0;a<row;a++) \n{ \nfor(b=0;b<column;b++) \n{ \nscanf(\"%d\",&m1[a][b]); \n} \n} \nprintf(\"Please enter the elements of second matrix:\\n\"); \nfor(a=0;a<row;a++) \n{ \nfor(b=0;b<column;b++) \n{ \nscanf(\"%d\",&m2[a][b]); \n} \n} \n \nprintf(\"Multiplying the two matrices:\\n\"); \nfor(a=0;a<row;a++) \n{ \nfor(b=0;b<column;b++) \n{ \nmultiple[a][b]=0; \nfor(c=0;c<column;c++) \n{ \nmultiple[a][b]+=m1[a][b]*m2[c][b]; \n} \n} \n} \n \nfor(a=0;a<row;a++) \n{ \nfor(b=0;b<column;b++) \n{ \nprintf(\"%d\\t\",multiple[a][b]); \n} \nprintf(\"\\n\"); \n} \nreturn 0; \n}<\/pre>\n
\nPlease enter the number of columns: 2
\nPlease enter the elements of first matrix:
\n144
\n1
\n2
\n35
\nPlease enter the elements of second matrix:
\n12
\n35
\n4
\n5
\nMultiplying the two matrices:
\n2304 40
\n32 1400<\/p>\n<\/div>\n7. Convert decimal to binary using C Programming<\/h3>\n
Decimal Number:-<\/h4>\n
Binary Number:-<\/h4>\n
\nFollowing is the table of binary values for the decimal numbers.<\/p>\n\n\n
\n Decimal<\/b><\/td>\n Binary<\/b><\/td>\n<\/tr>\n \n 1<\/span><\/td>\n 1<\/span><\/td>\n<\/tr>\n \n 2<\/span><\/td>\n 10<\/span><\/td>\n<\/tr>\n \n 3<\/span><\/td>\n 11<\/span><\/td>\n<\/tr>\n \n 4<\/span><\/td>\n 100<\/span><\/td>\n<\/tr>\n \n 5<\/span><\/td>\n 101<\/span><\/td>\n<\/tr>\n \n 6<\/span><\/td>\n 110<\/span><\/td>\n<\/tr>\n \n 7<\/span><\/td>\n 111<\/span><\/td>\n<\/tr>\n \n 8<\/span><\/td>\n 1000<\/span><\/td>\n<\/tr>\n \n 9<\/span><\/td>\n 1001<\/span><\/td>\n<\/tr>\n \n 10<\/span><\/td>\n 1010<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n Algorithm for converting decimal to binary:-<\/h3>\n
\n
#include<stdio.h> \n#include<stdlib.h> \nint main()\n{ \nint arr[10],num,a; \nprintf(\"TechVidvan Tutorial: Converting decimal to binary in C!\\n\\n\");\nprintf(\"Please enter the number which you want to convert: \"); \nscanf(\"%d\",&num); \nprintf(\"Binary value of the number %d is: \",num); \nfor(a=0;num>0;a++) \n{ \narr[a]=num%2; \nnum=num\/2; \n} \n \nfor(a=a-1;a>=0;a--) \n{ \nprintf(\"%d\",arr[a]); \n} \nreturn 0; \n}\n\n<\/pre>\n
\nBinary value of the number 12 is: 1100<\/p>\n<\/div>\nSummary<\/h3>\n