Page 449 - computer science (868) class 11
P. 449

5           //Member methods
                   6           boolean composite(int n)

                   7           {
                   8               int flag = 0,i;

                   9               for(i = 1; i <= n; i++)
                   10                  if(n % i == 0)

                   11                      flag++;
                   12              if(flag > 2)

                   13                  return true;
                   14              return false;

                   15          }
                   16          int sum_of_digits(int n)
                   17          {

                   18              int s = 0,i=n;

                   19              while(i!=0)
                   20              {
                   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++;




                                                                                                                       447
                                                                                                   Internal Assessment  447
   444   445   446   447   448   449   450   451   452   453   454