else {
                                                println( n + " isn't prime." );

                                                if( n == 5 ) {
                                                        println( "this is retarded" );
                                                        var i = 0;
                                                        var p : Long = primes.get( i );
                                                        while( i < found && p * p <= n && n % p != 0 ) {
                                                                println( "entered loop w/ " + p );
                                                                i += 1;
                                                                p = primes.get( i );
                                                                println( "exited loop w/ " + p );
                                                        }

                                                        println( "p * p = " + p * p );
                                                        print( "[ " );
                                                        for( x <- 0 until found ) {
                                                                print( primes.get( x ) + " " );
                                                        }
                                                        println( "]" );
                                                        println( "" );
                                                }
                                        }