botkit/botmath.js at master · segeila/botkit · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
<<<<<<< HEAD
=======

>>>>>>> 3f79b876dffff0bb273821454b62dcf4e2aecec2
var isPrime = function (n) {
 if (isNaN(n) || !isFinite(n) || n%1 || n<2) return false;
 if (n%2==0) return (n==2);
 var m=Math.sqrt(n);
 for (var i=3;i<=m;i+=2) {
  if (n%i==0) return false;
 }
 return true;
}

module.exports.isPrime = isPrime;

<<<<<<< HEAD

=======
>>>>>>> 3f79b876dffff0bb273821454b62dcf4e2aecec2
var sum = function (num1, num2) {
	return parseFloat(num1) + parseFloat(num2);
}

module.exports.sum = sum;

<<<<<<< HEAD
=======
var calculateFibonacciUpto = function(goal) {
	var fibonacci = [1, 1];
	while (fibonacci[fibonacci.length-1] < goal) {
		fibonacci.push(fibonacci[fibonacci.length-2] + fibonacci[fibonacci.length-1]);
	}
	return fibonacci;
}

module.exports.calculateFibonacciUpto = calculateFibonacciUpto;

>>>>>>> 3f79b876dffff0bb273821454b62dcf4e2aecec2
var isFibonacci = function (number) {
   var prev = 0;
   var curr = 1;
   while (prev <= number) {
       if (prev == number) {
           return 1;
       }
       curr = prev + curr;
       prev = curr - prev;
   }}

module.exports.isFibonacci = isFibonacci;
<<<<<<< HEAD

var findnextFibonacci = function (lowerLimit) {
	for (lowerLimit++; !isFibonacci(lowerLimit); lowerLimit++){
		return lowerLimit;
	}
}

module.exports.findnextFibonacci = findnextFibonacci;

=======

var findnextFibonacci = function (lowerLimit) {
	for (lowerLimit++; !isFibonacci(lowerLimit); lowerLimit++);
	return lowerLimit;
}

module.exports.findnextFibonacci = findnextFibonacci;
>>>>>>> 3f79b876dffff0bb273821454b62dcf4e2aecec2