Smith Number in Java
Channel:
Subscribers:
1,540
Published on ● Video Link: https://www.youtube.com/watch?v=BETdWyWcwuA
1Smith Number in Java
In this tutorial, I have shown how to write a Java program to check for Smith Numbers.
A Smith Number is one whose sum of digits is equal to the sum of digits of all its prime factors.
Example: 85 is a Smith Number.
Other Videos By Robin Sir
| 2023-10-12 | Hamming Number in Java |
| 2023-10-10 | Lecture 4 ID Function in Python |
| 2023-10-01 | Lecture 3 Input in Python |
| 2023-09-30 | Lecture 2 Variables in Python |
| 2023-09-28 | Lecture 1 Getting Started with Python |
| 2023-09-14 | Download Scratch on Windows |
| 2023-09-10 | Fascinating Number in Java |
| 2023-07-21 | Circular Prime in Java |
| 2023-07-12 | Unit Matrix in Java |
| 2023-07-09 | Fill Matrix Column-wise in Java |
| 2023-07-07 | Smith Number in Java |
| 2023-07-05 | Record Class Inheritance in Java | ISC 2019 |
| 2023-07-04 | Toggle Case in Java |
| 2023-07-02 | Fibonacci String in Java |
| 2023-07-02 | Anagram Program in Java |
| 2023-06-30 | Binary Search in Java using Recursion |
| 2023-06-29 | Armstrong Number in Java |
| 2023-06-28 | Evil Number in Java |
| 2023-06-27 | Special Number in Java |
| 2023-06-26 | Prime Factorization in Java |
| 2023-06-25 | Happy Number in Java |
Tags:
robin sir
smith number program in java
smith number
smith number example
java
isc
computer science
recursion