MurageKibicho

#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
typedef struct iris_dataset_struct
{
   double inputs[4];
   double output[3];
} iris_dataset_holder;

iris_dataset_holder iris_dataset_holder_array[ ] = 

MurageKibicho

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
double LogN(double number, int base)
{
	return log((double)number) / log((double)base);
}

void Base10ToBaseN(int number, int base, int *baseLength, int **baseHolder)
{

MurageKibicho

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <assert.h>
#include <gmp.h>
//Run command : clear && gcc BlankinshipGMP.c -lgmp -lm -o m.o && ./m.o

typedef struct blankinship_row_struct *BlankinshipRow;
typedef BlankinshipRow* BlankinshipMatrix;
struct blankinship_row_struct

MurageKibicho

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <assert.h>
typedef struct blankinship_row_struct *BlankinshipRow;
typedef BlankinshipRow* BlankinshipMatrix;
struct blankinship_row_struct
{
	int leader;
	int numberOfColumns;

MurageKibicho

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

// Function to compute (base^exp) % mod using fast modular exponentiation
long long mod_exp(long long base, long long exp, long long mod) {
    long long result = 1;
    while (exp > 0) {
        if (exp % 2 == 1) result = (result * base) % mod;
        base = (base * base) % mod;

MurageKibicho

//Code from this Murage Kibicho answer on Stack Exchange : https://math.stackexchange.com/questions/3260673/primes-having-2-as-a-primitive-root/5041497#5041497
#include <stdio.h>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define TRUE 1
#define FALSE 0

int ModularExponentiation(int base, int exp, int mod) 
{

MurageKibicho

// Online C compiler to run C program online
#include <stdio.h>
#include <stdint.h>

typedef	int64_t fixedpt;
#define FIXEDPT_BITS	32
#define FIXEDPT_WBITS	24
#define FIXEDPT_FBITS	(FIXEDPT_BITS - FIXEDPT_WBITS)
#define FIXEDPT_ONE	((fixedpt)((fixedpt)1 << FIXEDPT_FBITS))
#define fixedpt_rconst(R) ((fixedpt)((R) * FIXEDPT_ONE + ((R) >= 0 ? 0.5 : -0.5)))

MurageKibicho

#ifndef _FFASM_H_
#define _FFASM_H_

#ifndef ff_BITS
#define ff_BITS 32
#endif

#include <stdarg.h> 
#include <stdint.h>
#include <stdio.h> 

MurageKibicho

#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <assert.h>

#define PI 3.14159265358979323846  
#define MIN_BETA 0.0001
#define MAX_BETA 0.9999

float DiffusionInternalSigmoid(float x)

MurageKibicho

#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <assert.h>

#define PI 3.14159265358979323846  
#define MIN_BETA 0.0001
#define MAX_BETA 0.9999

float DiffusionInternalSigmoid(float x)