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 examples in the same category

1.	Simplest for
2.	For loop for array
3.	The finished C# statement Help system that processes multiple requests
4.	Determine smallest single-digit factor
5.	A negatively running for loop
6.	loop with letter char as the control variable
7.	Use commas in a for statememt
8.	Use commas in a for statememt to find the largest and smallest factor of a number
9.	Loop condition can be any bool expression
10.	Parts of the for can be empty
11.	Move more out of the for loop
12.	The body of a loop can be empty
13.	Declare loop control variable inside the for
14.	Using break to exit a loop
15.	Use continue
16.	Demonstrate the for loop
17.	Compute the sum and product of the numbers from 1 to 10.
18.	For Loop Tester
19.	If inside a for
20.	For without init value
21.	For without increase
22.	For with empty condition
23.	a for loop to display 1 to 5
24.	Update two parameters in for loop

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

Related examples in the same category