c# metot kullanarak mükemmel sayı bulma ?

 
   static bool MukemmelSayı(int sayi) 
          { 
              System.Collections.ArrayList carpanlar = new System.Collections.ArrayList(); 
              int temp = 0; 
   
              for (int i = 1; i < sayi; i++) 
              { 
                  if (sayi % i == 0) 
                  { 
                      carpanlar.Add(i); 
                  } 
              } 
   
              foreach (int carpan in carpanlar) 
              { 
                  temp += carpan; 
              } 
              if(temp == sayi) 
              { 
                  return true; 
              } 
              else 
              { 
                  return false; 
              }        
          } 
  

 
  static int[] Erastosthenes_Sieve(int Max) 
  		{ 
  			int kök = (int)Math.Floor(Math.Sqrt(Max)); 
  			int[] Prime_list = new Int32[Max]; 
  			 
   
  			System.Collections.Hashtable table = new System.Collections.Hashtable(); 
  			for (int i = 2; i < Max; i++) 
  			{                                
  				table.Add(i,i);                
  			} 
  			object[] keys = new object[table.Keys.Count]; 
  			table.Keys.CopyTo(keys, 0); 
   
  			 
   
  			for (int i = 2; i <= Max; i++) 
  			{ 
  				if (i > kök) 
  				{ 
  					break; 
  				} 
  				else 
  				{ 
  					foreach (int key in keys) 
  					{ 
  						if (key != i &&key % i == 0) 
  						{ 
  							table.Remove(key); 
  						} 
  					} 
  				} 
   
  			} 
  			int it = 0; 
  			foreach(int name in table.Keys) 
  			{ 
  				Prime_list[it] = name; 
  				it++; 
  			} 
  				return Prime_list; 
  		}