Java Basic
Java Interview Programs
- Java Interview Programs
- Java Abundant Number
- Java Amicable Number
- Java Armstrong Number
- Java Average of N Numbers
- Java Automorphic Number
- Java Biggest of three numbers
- Java Binary to Decimal
- Java Common Divisors
- Java Composite Number
- Java Condense a Number
- Java Cube Number
- Java Decimal to Binary
- Java Decimal to Octal
- Java Disarium Number
- Java Even Number
- Java Evil Number
- Java Factorial of a Number
- Java Fibonacci Series
- Java GCD
- Java Happy Number
- Java Harshad Number
- Java LCM
- Java Leap Year
- Java Magic Number
- Java Matrix Addition
- Java Matrix Division
- Java Matrix Multiplication
- Java Matrix Subtraction
- JS Matrix Transpose
- Java Maximum Value of an Array
- Java Minimum Value of an Array
- Java Multiplication Table
- Java Natural Number
- Java Number Combination
- Java Odd Number
- Java Palindrome Number
- Java Pascalβs Triangle
- Java Perfect Number
- Java Perfect Square
- Java Power of 2
- Java Power of 3
- Java Pronic Number
- Java Prime Factor
- Java Prime Number
- Java Smith Number
- Java Strong Number
- Java Sum of Array
- Java Sum of Digits
- Java Swap Two Numbers
- Java Triangular Number
Java 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 Java program that checks whether a given number is a Smith Number.
π Example
Let's take a look at the Java code that checks whether a given number is a Smith Number.
public class SmithNumber {
// Function to calculate the sum of digits in a number
static 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
static 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
static boolean isSmithNumber(int num) {
return sumOfDigits(num) == sumOfPrimeFactors(num);
}
// Driver program
public static void main(String[] args) {
// Replace this value with your desired number
int number = 85;
// Check if the number is a Smith Number
if (isSmithNumber(number)) {
System.out.println(number + " is a Smith Number.");
} else {
System.out.println(number + " is not a Smith Number.");
}
}
}
π» Testing the Program
To test the program with different numbers, replace the value of number in the main method.
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 a class SmithNumber containing static methods sumOfDigits to calculate the sum of digits, sumOfPrimeFactors to calculate the sum of digits in the prime factorization, and isSmithNumber to check if a number is a Smith Number.
- The main method 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 java code that checks for Smith Numbers in the specified range.
public class SmithNumber {
// Function to calculate the sum of digits
static 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
static 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
static boolean 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
static boolean isSmithNumber(int n) {
return isPrime(n) ? false : sumOfDigits(n) == sumOfPrimeFactors(n);
}
// Driver program
public static void main(String[] args) {
System.out.println("Smith Numbers in the Range 1 to 100:");
// Check numbers from 1 to 100
for (int i = 1; i <= 100; ++i) {
if (isSmithNumber(i)) {
System.out.print(i + " ");
}
}
System.out.println();
}
}
π» 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 (Java Program to Check Smith Number), please comment here. I will help you immediately.