Posts

Showing posts with the label anti-primes

Anti-primes | Rosetta Code | #3

URL to the problem page:  https://rosettacode.org/wiki/Anti-primes The anti-primes (or highly composite numbers) are the natural numbers with more factors than any smaller than itself. Generate and show here, the first twenty anti-primes. #include   <iostream> using   namespace   std ; int   main () {      int  counter =  1 , counter2, counter3, check,  numbers [ 20 ] = {  0  }, a =  0 ;      for  ( int  i =  1 ; counter <  21 ; i++) {         check =  0 ;         counter2 =  0 ;          for  ( int  j =  1 ; j <= (i /  2 ); j++) {            ...
My photo
Ercan Tomac
instagram.com/ercantomac