Finding all prime numbers before limit . These numbers are used to find prime factors .
sieveSundaram ( ) ; cout << " Printing ▁ first ▁ few ▁ Equidigital ▁ Numbers " " ▁ using ▁ isEquidigital ( ) STRNEWLINE " ; for ( int i = 1 ; i < 20 ; i ++ ) if ( isEquidigital ( i ) ) cout << i << " ▁ " ; return 0 ; }