Initial commit

Assigments/1/Shoebottom_Isaac_A1/isFib.c

@@ -0,0 +1,9 @@
+#include <math.h>
+int isPerfectSquare(int i) {
+    int s = sqrt(i);
+    return (s*s == i);
+}
+
+int isFib(int i) {
+    return isPerfectSquare(5*i*i+4) || isPerfectSquare(5*i*i -4);
+}

Assigments/1/Shoebottom_Isaac_A1/isFibPrime.c

@@ -0,0 +1,22 @@
+#include <stdio.h>
+
+int isFib (int i);
+int isPrime(int i);
+
+int main() {
+    int x1, x2;
+    printf("Please enter min value: ");
+    scanf("%d", &x1);
+    printf("Please enter max value: ");
+    scanf("%d", &x2);
+
+    int i;
+    for(i = x1; i <= x2; i++) {
+        if ((isFib(i) == 1) && (isPrime(i) == 1)) {
+            printf("%d ", i);
+        }
+    }
+    printf("\n");
+
+    return 0;
+}

Assigments/1/Shoebottom_Isaac_A1/isPrime.c

@@ -0,0 +1,13 @@
+#include <math.h>
+int isPrime(int i) {
+    if (i < 2) {
+        return 0;
+    }
+    int j, k = sqrt(i);
+    for(j = 2; j <= k; j++) {
+        if (i % j == 0) {
+            return 0;
+        }
+    }
+    return 1;
+}

Assigments/1/Shoebottom_Isaac_A1/testingFib.c

@@ -0,0 +1,15 @@
+#include <stdio.h>
+
+int isFib(int i);
+
+int main() {
+    int i;
+    printf("Please enter a number to check if part of fibonacci sequence: ");
+    scanf("%d", &i);
+    if(isFib(i) == 1){
+        printf("Your number is part of the fibonacci sequence");
+    }
+    else {
+        printf("Your number is not part of the fibonacci sequence");
+    }
+}

Assigments/1/Shoebottom_Isaac_A1/testingPrimes.c

@@ -0,0 +1,15 @@
+#include <stdio.h>
+
+int isPrime(int i);
+
+int main() {
+    int i;
+    printf("Please enter a number to check if prime: ");
+    scanf("%d", &i);
+    if(isPrime(i) == 1){
+        printf("Your number is prime");
+    }
+    else {
+        printf("Your number is not prime");
+    }
+}

Assigments/1/isFib.c

@@ -0,0 +1,9 @@
+#include <math.h>
+int isPerfectSquare(int i) {
+    int s = sqrt(i);
+    return (s*s == i);
+}
+
+int isFib(int i) {
+    return isPerfectSquare(5*i*i+4) || isPerfectSquare(5*i*i -4);
+}

Assigments/1/isFibPrime.c

@@ -0,0 +1,22 @@
+#include <stdio.h>
+
+int isFib (int i);
+int isPrime(int i);
+
+int main() {
+    int x1, x2;
+    printf("Please enter min value: ");
+    scanf("%d", &x1);
+    printf("Please enter max value: ");
+    scanf("%d", &x2);
+
+    int i;
+    for(i = x1; i <= x2; i++) {
+        if ((isFib(i) == 1) && (isPrime(i) == 1)) {
+            printf("%d ", i);
+        }
+    }
+    printf("\n");
+
+    return 0;
+}

Assigments/1/isPrime.c

@@ -0,0 +1,13 @@
+#include <math.h>
+int isPrime(int i) {
+    if (i < 2) {
+        return 0;
+    }
+    int j, k = sqrt(i);
+    for(j = 2; j <= k; j++) {
+        if (i % j == 0) {
+            return 0;
+        }
+    }
+    return 1;
+}

Assigments/1/testingFib.c

@@ -0,0 +1,15 @@
+#include <stdio.h>
+
+int isFib(int i);
+
+int main() {
+    int i;
+    printf("Please enter a number to check if part of fibonacci sequence: ");
+    scanf("%d", &i);
+    if(isFib(i) == 1){
+        printf("Your number is part of the fibonacci sequence");
+    }
+    else {
+        printf("Your number is not part of the fibonacci sequence");
+    }
+}

Assigments/1/testingPrimes.c

@@ -0,0 +1,15 @@
+#include <stdio.h>
+
+int isPrime(int i);
+
+int main() {
+    int i;
+    printf("Please enter a number to check if prime: ");
+    scanf("%d", &i);
+    if(isPrime(i) == 1){
+        printf("Your number is prime");
+    }
+    else {
+        printf("Your number is not prime");
+    }
+}