Determine if a number is prime. If it is not, then display its largest factor : for : Language Basics C# Source Code

Determine if a number is prime. If it is not, then display its largest factor

    

/*
C#: The Complete Reference 
by Herbert Schildt 

Publisher: Osborne/McGraw-Hill (March 8, 2002)
ISBN: 0072134852
*/
/* 
   Determine if a number is prime.  If it is not, 
   then display its largest factor. 
*/ 
 
using System; 
 
public class FindPrimes {    
  public static void Main() {    
    int num; 
    int i; 
    int factor; 
    bool isprime; 
 
 
    for(num = 2; num < 20; num++) { 
      isprime = true;  
      factor = 0; 
 
      // see if num is evenly divisible 
      for(i=2; i <= num/2; i++) { 
        if((num % i) == 0) { 
          // num is evenly divisible -- not prime 
          isprime = false; 
          factor = i; 
        } 
      } 
 
      if(isprime) 
        Console.WriteLine(num + " is prime."); 
      else 
        Console.WriteLine("Largest factor of " + num + 
                          " is " + factor); 
    } 
  }    
}

           
       
    
   
  
   

Related in same category :
• Simplest for
• For loop for array
• The finished C# statement Help system that processes multiple requests
• Determine smallest single-digit factor
• A negatively running for loop
• loop with letter char as the control variable
• Use commas in a for statememt
• Use commas in a for statememt to find the largest and smallest factor of a number
• Loop condition can be any bool expression
• Parts of the for can be empty
• Move more out of the for loop
• The body of a loop can be empty
• Declare loop control variable inside the for