JavaScript Fibonacci column reverse output within 100 prime numbers

| - Fibonacci number

1  // find Fibonacci number of n-bit 
2  var n = the parseInt (window.prompt ( 'Fibonacci input bits of Number of your request' ));
 . 3  var First = 1 ,
 . 4      SECOND = 1 ,
 . 5      THIRD;
 . 6  IF (n-> 2 ) {
 . 7      for ( var I = 0; I <n-- 2; I ++ ) {
 . 8          THIRD = First + SECOND;
 . 9          First = SECOND;
 10          SECOND = THIRD;
 . 11          document.writeln ( 'Fibonacci number sequence of Qi' + (i + 3) + ' bit is:' + THIRD)
 12 is      }
13 } else {
14     document.writeln(1);
15 }

Fibonacci Numbers by column bit n

| - reverse output

1   // descending output 
2  var n-window.prompt = ( "Please enter a three-digit integer" );
 . 3  for ( var I = n.length; I> = 0; i-- ) {
 . 4      document.writeln (n- .charAt (I));
 . 5  }
 . 6 document.writeln (A);

Reverse output

| - prime numbers less than 100 output

1  // determines whether the prime number 
2  var COUNT = 0;   // counter 
. 3  for ( var i = 1; i <100; i ++ ) {
 . 4      // see if each i prime 
. 5      for ( var J = 1; J <= I; J ++ ) {
 . 6          IF (% I J == 0 ) {
 . 7              // count the number is divisible 
. 8              COUNT ++ ;
 . 9          }
 10      }
 . 11      // if the number is divisible by 2 is equal to twice the number of output 
12 is      IF ( 2 == COUNT ) {
 13 is         document.writeln (I + "" );
 14      }
 15      // counter is cleared 
16      COUNT = 0 ;
 . 17 }

Output prime numbers less than 100