-
Notifications
You must be signed in to change notification settings - Fork 118
/
JacobsthalNumbers.c
56 lines (48 loc) · 1.25 KB
/
JacobsthalNumbers.c
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
/*
Compile Instructions:
In order to compile this code use must link the math library.
Example: gcc JacobsthalNumbers.c -o exec -lm
*/
#include <stdio.h>
#include <math.h>
#define BASE 2
#define DENOMINATOR 3
void green() {
printf("\033[32m");
}
void reset() {
printf("\033[0m");
}
unsigned long long myPow(unsigned long long n) {
int i;
int number = 1;
for (i = 0; i < n; ++i)
number *= BASE;
return(number);
}
void findJacobsthalNumber(unsigned long long index) {
unsigned long long firstTerm, secondTerm, numerator, endResult;
printf("Jacobsthal sequence: ");
for (unsigned long long i = 0; i <= index; ++i) {
firstTerm = myPow(i);
secondTerm = i % 2 == 0 ? 1 : -1;
numerator = firstTerm - secondTerm;
endResult = numerator / DENOMINATOR;
if ( i == index) {
green();
printf(" %llu", endResult);
reset();
printf("...\n");
} else {
printf(" %llu ", endResult);
}
}
}
int main() {
unsigned long long index;
printf("Jacobsthal Number: J_n = ( 2^n - (-1)^n ) / 3\n");
printf("Enter the nth element of Jacobsthal sequence: ");
scanf("%llu",&index);
findJacobsthalNumber(index);
return 0;
}