From 20f3efa5f468aa3b87fbdf02324f98042f270ac5 Mon Sep 17 00:00:00 2001
From: donmaiq <kayhty@windowslive.com>
Date: Tue, 23 Feb 2016 11:03:22 +0200
Subject: [PATCH 1/3] working primes, if number not prime, 10 previous primes
 printed

---
 bot.js | 61 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 61 insertions(+)

diff --git a/bot.js b/bot.js
index 00eb7b9bd..0db46d13d 100755
--- a/bot.js
+++ b/bot.js
@@ -83,6 +83,67 @@ var bot = controller.spawn({
     token: process.env.token
 }).startRTM();
 
+controller.hears(['prime (.*)'],'direct_message,direct_mention,mention',function(bot, message) {
+    var matches = message.text.match(/prime (.*)/i);
+    var number = matches[1];
+    var n = 2;
+    var isprime=true;
+    for(var i=2; i<=number; i++){
+      if(number%i==0 && i!=number){
+        isprime=false
+      }
+    }
+    if(number<2){
+      isprime=false;
+    }
+    if(isprime){
+      bot.reply(message, number+' is a Prime');
+    }
+    else{
+      bot.reply(message, number+' is not a Prime, the previous 10 primes are:');
+
+      var string = '';
+      var match = 0;
+      var n = number;
+      while (match !=10 && n!=1){
+        var isprime = true;
+        for(var count = 2;count<n;count++ ){
+          if(n%count === 0 && count!==n){
+              isprime = false;
+          }
+
+        }    
+        if(isprime == true){
+          string +=n+' ';
+          match = match+1;
+        }
+        n--;
+     }
+     bot.reply(message,string);
+    }
+});
+
+
+controller.hears(['prime'],'direct_message,direct_mention,mention',function(bot, message) {  
+ var string = '';
+ var match = 0;
+ var n = 2;
+ while (match !=10){
+    var isprime = true;
+    for(var count = 2;count<n;count++ ){
+      if(n%count === 0 && count!==n){
+          isprime = false;
+      }
+
+    }    
+    if(isprime == true){
+      string +=n+' ';
+      match = match+1;
+    }
+    n++;
+ }
+ bot.reply(message,string);
+});
 
 controller.hears(['hello','hi'],'direct_message,direct_mention,mention',function(bot, message) {
 

From 5df94879e4804e2db2f3b79d1e0016eb68fcf820 Mon Sep 17 00:00:00 2001
From: rgbm21 <Abul.MidhatHasanRaghib@metropolia.fi>
Date: Tue, 23 Feb 2016 12:30:47 +0200
Subject: [PATCH 2/3] add gitignore

---
 .gitignore | 1 +
 1 file changed, 1 insertion(+)
 create mode 100644 .gitignore

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 000000000..c2658d7d1
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1 @@
+node_modules/

From 33b8d5080490bc58bb76246f36d1ea9428f0ac0c Mon Sep 17 00:00:00 2001
From: rgbm21 <Abul.MidhatHasanRaghib@metropolia.fi>
Date: Tue, 23 Feb 2016 12:31:05 +0200
Subject: [PATCH 3/3] Fix Prime [George changes]

---
 bot.js | 132 ++++++++++++++++-----------------------------------------
 1 file changed, 36 insertions(+), 96 deletions(-)

diff --git a/bot.js b/bot.js
index 0db46d13d..03a46b24c 100755
--- a/bot.js
+++ b/bot.js
@@ -26,7 +26,7 @@ This bot demonstrates many of the core features of Botkit:
   Run your bot from the command line:
 
     set token=<MY TOKEN>
-	
+
 	node bot.js
 
 # USE THE BOT:
@@ -83,66 +83,42 @@ var bot = controller.spawn({
     token: process.env.token
 }).startRTM();
 
-controller.hears(['prime (.*)'],'direct_message,direct_mention,mention',function(bot, message) {
-    var matches = message.text.match(/prime (.*)/i);
-    var number = matches[1];
-    var n = 2;
-    var isprime=true;
-    for(var i=2; i<=number; i++){
-      if(number%i==0 && i!=number){
-        isprime=false
-      }
-    }
-    if(number<2){
-      isprime=false;
-    }
-    if(isprime){
-      bot.reply(message, number+' is a Prime');
-    }
-    else{
-      bot.reply(message, number+' is not a Prime, the previous 10 primes are:');
-
-      var string = '';
-      var match = 0;
-      var n = number;
-      while (match !=10 && n!=1){
-        var isprime = true;
-        for(var count = 2;count<n;count++ ){
-          if(n%count === 0 && count!==n){
-              isprime = false;
-          }
-
-        }    
-        if(isprime == true){
-          string +=n+' ';
-          match = match+1;
-        }
-        n--;
-     }
-     bot.reply(message,string);
+controller.hears('prime',['direct_message', 'direct_mention', 'mention'],function(bot,message) {
+    if (message.text === "prime") {
+        return bot.reply(message, '2, 3, 5, 7, 11, 13, 17, 19, 23, 29');
     }
 });
 
+controller.hears('prime (.*)',['direct_message', 'direct_mention', 'mention'],function(bot,message) {
+
+    var parameter = parseInt(message.match[1]);
+
+    if (MathHelper.isPrime(parameter)) {
+        var primes = new Array();
+        var number = parameter + 1;
+
+        while (primes.length < 10) {
+						if(number < 2)
+							break;
+
+            if (MathHelper.isPrime(number)) {
+                primes.push(number);
+            }
+
+            number--;
+						console.log(number);
+        }
+
+        var reply = "";
+        for (var i = 0; i < primes.length; i++) {
+            reply += primes[i] + " ";
+        }
 
-controller.hears(['prime'],'direct_message,direct_mention,mention',function(bot, message) {  
- var string = '';
- var match = 0;
- var n = 2;
- while (match !=10){
-    var isprime = true;
-    for(var count = 2;count<n;count++ ){
-      if(n%count === 0 && count!==n){
-          isprime = false;
-      }
-
-    }    
-    if(isprime == true){
-      string +=n+' ';
-      match = match+1;
+        return bot.reply(message, reply);
+    }
+    else {
+        return bot.reply(message, "your parameter: " + parameter + " is not Prime number");
     }
-    n++;
- }
- bot.reply(message,string);
 });
 
 controller.hears(['hello','hi'],'direct_message,direct_mention,mention',function(bot, message) {
@@ -238,9 +214,9 @@ controller.hears(['fibonacci'], 'direct_message,direct_mention,mention', functio
 
 controller.hears(['fibonacci ([0-9]+)'], 'direct_message,direct_mention,mention', function(bot, message) {
     var parameter = parseInt(message.match[1]);
-    
+
     var fibonacci = calculateFibonacciUpto(parameter);
-    
+
     if (fibonacci[fibonacci.length-1] !== parameter) {
         bot.reply(message, 'That is not a Fibonacci number!');
     }
@@ -251,11 +227,11 @@ controller.hears(['fibonacci ([0-9]+)'], 'direct_message,direct_mention,mention'
 
 function calculateFibonacciUpto(goal) {
     var fibonacci = [1, 1];
-    
+
     while (fibonacci[fibonacci.length-1] < goal) {
         fibonacci.push(fibonacci[fibonacci.length-2] + fibonacci[fibonacci.length-1]);
     }
-    
+
     return fibonacci;
 }
 
@@ -276,39 +252,3 @@ function formatUptime(uptime) {
     uptime = uptime + ' ' + unit;
     return uptime;
 }
-
-controller.hears('prime',['direct_message', 'direct_mention', 'mention'],function(bot,message) {
-    if (message.text === "prime") {
-        return bot.reply(message, '2, 3, 5, 7, 11, 13, 17, 19, 23, 29');
-    }
-});
-
-controller.hears('prime (.*)',['direct_message', 'direct_mention', 'mention'],function(bot,message) {
-
-    var parameter = parseInt(message.match[1]);
-
-    if (MathHelper.isPrime(parameter)) {
-        var primes = new Array();
-        var number = parameter + 1;
-
-        while (primes.length < 10) {
-
-            if (MathHelper.isPrime(number)) {
-                primes.push(number);
-            }
-
-            number++;
-        }
-
-        var reply = "";
-        for (var i = 0; i < primes.length; i++) {
-            reply += primes[i] + " ";
-        }
-
-        return bot.reply(message, reply);
-    }
-    else {
-        return bot.reply(message, "your parameter: " + parameter + " is not Prime number");
-    }
-});
-