Page 572 - ComputerScience_Class_11

21 s += i % 10;
22 i /= 10;
23 }

24 return s;
25 }
26 int sum_prime(int n)

27 {
28 int s,f;
29 s = 0;

30 f = 2;
31 while(n != 1)
32 {

33 for(;n % f == 0 && f <= n;)
34 {
35 s += sum_of_digits(f);

36 n /= f;
37 }
38 f++;

39 }
40 return s;
41 }

42 //main method
43 public static void main(String args[])
44 {

45 Scanner sc=new Scanner(System.in);
46 Smith ob=new Smith();
47 int n,sum1,sum2;

48 System.out.println("Checking whether a number is a Smith Number or not ");
49 System.out.print("Enter a number = ");
50 n = sc.nextInt();

51 if(ob.composite(n)){
52 sum1 = ob.sum_of_digits(n);

53 sum2 = ob.sum_prime(n);
54 if(sum1 == sum2)
55 System.out.println(n + " is a Smith Number.");

56 else

570 Touchpad Computer Science (Ver. 3.0)-XI