C Topics
- C Intro
- C Control Statement
- C Control Loops
- C String Functions
- C Math Functions
- C Header Files
- C Interview Programs
- Abundant Number
- Amicable Number
- Armstrong Number
- Average of N Numbers
- Automorphic Number
- Biggest of three numbers
- Binary to Decimal
- Common Divisors
- Composite Number
- Condense a Number
- Cube Number
- Decimal to Binary
- Decimal to Octal
- Disarium Number
- Even Number
- Evil Number
- Factorial of a Number
- Fibonacci Series
- GCD
- Happy Number
- Harshad Number
- LCM
- Leap Year
- Magic Number
- Matrix Addition
- Matrix Division
- Matrix Multiplication
- Matrix Subtraction
- Matrix Transpose
- Maximum Value of an Array
- Minimum Value of an Array
- Multiplication Table
- Natural Number
- Number Combination
- Odd Number
- Palindrome Number
- Pascalβs Triangle
- Power of 2
- Power of 3
- Pronic Number
- Perfect Number
- Perfect Square
- Prime Factor
- Prime Number
- Smith Number
- Strong Number
- Sum of Array
- Sum of Digits
- Swap Two Numbers
- Triangular Number
- C Star Pattern
- C Number Pattern
- C Alphabet Pattern
C Program to Check Smith Number
Photo Credit to CodeToFun
π Introduction
In the realm of programming, exploring number properties is a common and fascinating endeavor. One interesting type of number is the Smith Number.
A Smith Number is a composite number for which the sum of its digits is equal to the sum of the digits in its prime factorization.
In this tutorial, we'll delve into a C program that checks whether a given number is a Smith Number.
π Example
Let's take a look at the C code that checks whether a given number is a Smith Number.
#include <stdio.h>
#include <stdbool.h>
// Function to calculate the sum of digits in a number
int sumOfDigits(int num) {
int sum = 0;
while (num > 0) {
sum += num % 10;
num /= 10;
}
return sum;
}
// Function to calculate the sum of digits in the prime factorization of a number
int sumOfPrimeFactors(int num) {
int i = 2, sum = 0;
while (num > 1) {
while (num % i == 0) {
sum += sumOfDigits(i);
num /= i;
}
i++;
}
return sum;
}
// Function to check if a number is a Smith Number
bool isSmithNumber(int num) {
return sumOfDigits(num) == sumOfPrimeFactors(num);
}
// Driver program
int main() {
// Replace this value with your desired number
int number = 85;
// Check if the number is a Smith Number
if (isSmithNumber(number)) {
printf("%d is a Smith Number.\n", number);
} else {
printf("%d is not a Smith Number.\n", number);
}
return 0;
}
π» Testing the Program
To test the program with different numbers, replace the value of number in the main function.
85 is a Smith Number.
Compile and run the program to check whether the given number is a Smith Number.
π§ How the Program Works
- The program defines three functions: sumOfDigits to calculate the sum of digits in a number, sumOfPrimeFactors to calculate the sum of digits in the prime factorization, and isSmithNumber to check if a number is a Smith Number.
- The main function replaces the value of number with the desired number and checks if it is a Smith Number.
- The program utilizes loops and arithmetic operations to calculate the sum of digits and the sum of digits in the prime factorization.
π Between the Given Range
Let's take a look at the C code that checks for Smith Numbers in the specified range.
#include <stdio.h>
#include <stdbool.h>
// Function to calculate the sum of digits
int sumOfDigits(int n) {
int sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
// Function to calculate the sum of prime factors
int sumOfPrimeFactors(int n) {
int sum = 0;
for (int i = 2; i <= n; ++i) {
while (n % i == 0) {
sum += sumOfDigits(i);
n /= i;
}
}
return sum;
}
// Function to check if a number is prime
bool isPrime(int n) {
if (n <= 1) {
return false;
}
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
// Function to check if a number is a Smith Number
bool isSmithNumber(int n) {
return isPrime(n) ? false : sumOfDigits(n) == sumOfPrimeFactors(n);
}
// Driver program
int main() {
printf("Smith Numbers in the Range 1 to 100:\n");
// Check numbers from 1 to 100
for (int i = 1; i <= 100; ++i) {
if (isSmithNumber(i)) {
printf("%d ", i);
}
}
printf("\n");
return 0;
}
π» Testing the Program
Smith Numbers in the Range 1 to 100: 4 22 27 58 85 94
Compile and run the program to see the Smith Numbers in the specified range.
π§ How the Program Works
- The program defines a function isPrime to check if a number is prime.
- The isSmithNumber function checks if a number is a Smith Number by comparing the sum of its digits with the sum of the digits in its prime factorization.
- The main function checks and prints Smith Numbers in the range from 1 to 100.
π§ Understanding the Concept of Smith Numbers
Before delving into the code, it's crucial to understand the concept of Smith Numbers. These numbers exhibit a unique property where the sum of their digits is equal to the sum of the digits in their prime factorization.
For example, 4, 22, 27, and 85 are Smith Numbers.
π’ Optimizing the Program
While the provided program is effective, consider exploring optimizations for larger numbers. You can further refine the code for improved efficiency or adapt it to your specific requirements.
Feel free to incorporate and modify this code as needed for your specific use case. Happy coding!
π¨βπ» Join our Community:
Author
For over eight years, I worked as a full-stack web developer. Now, I have chosen my profession as a full-time blogger at codetofun.com.
Buy me a coffee to make codetofun.com free for everyone.
Buy me a Coffee
If you have any doubts regarding this article (C Program to Check Smith Number), please comment here. I will help you immediately.