My videos

Sum of prime numbers from 1 to N in c#   public int SumOfPrimeNumberUptoN( int loopNumber) {            List< string > collection = new List< string >();             int count=0, sum = 0;             for ( int num = 1; num <= loopNumber; num++)            {                count = 0;                 for ( int i = 2; i <= num/2; i++)                {                     if (num % i == 0) {     ...

Perfect numbers from 1 to N in C#   public string CheckPerfectNumberUptoN( int loopNumber)        {            List< string > collection = new List< string >();             for ( int num = 1; num <= loopNumber; num++)            {                 int i = 1, sum = 0;                 while (i < num)                {                     if (num % i == 0)               ...

Strong number in c sharp c# public bool CheckStrongNumber( int n)        {             int i, n1, s1 = 0, j;             int fact;            n1 = n;             for (j = n; j > 0; j = j / 10)            {                fact = 1;                 for (i = 1; i <= j % 10; i++)                {                    fact = fact * i;   ...

Perfect number in c# public bool CheckPerfectNumber( int number) {             bool isPerfectNumber= false ;             int  i = 1, sum = 0;                        while (i < number)            {                 if (number % i == 0)                    sum = sum + i;                i++;            }             if (sum == number)   ...