## 0.1 bash: /usr/bin/java: cannot execute binary file

When you get this error, it means that you are using the wrong version of JDK to run a specific java file. To fix this you must uninstall your current version of JDK. Next you must install the correct architecture of JDK. This for most people means install the 64-bit version of JDK.

undefined

### Java Fibonacci Solver

##### Sun Apr 19 2015

The Fibonacci Sequence is a series of numbers where the next number is found by adding the previous two numbers.

Ex:

n 1 2 3 4 5 6
x 1 1 2 3 5 8
class Fibonacci
{
public static void main(String[] args)
{
for(int i = 1; i < 60; i ++)
{
System.out.println("Fibonacci " + i + " is: t" + fib(i));
}
}

//recursive definition of Fibonacci
public static double fib(int n)
{
if(n == 1 \|\| n == 2)
{
return(1);
}
return(fib(n -1) + fib(n -2));
}
}

### Batch Minecraft Launcher with Auto Restart

##### Sat Apr 18 2015


@echo off

color a

title server Name

:startServer

echo starting server

echo (%time%)

java -Xmx1024M -jar caftbukkit.jar -o true

echo (%time%) WARNING: Minecraft server closed or crashed, restarting

ping 127.0.0.1 -n 5

goto startServer


This batch script great for Minecraft servers which frequently crash – for whatever reason. If you want to learn more about how this script works I would recommend that you look up a batch tutorial online. This script is just a big loop which restarts whenever the server crashes. If you like to use this, just copy and paste it into a batch file (ends with .bat) and make sure that it is in the same directory as your Minecraft server. Also, the “craftbukkit.jar” should be the name of the jar file that you use to run your server.

Happy mining.

### Ackermann Function Written in Java

##### Sat Apr 18 2015

class Ackermann_function
{
public static void main(String[] args)
{
//prints intro

System.out.println("This program will solve for all values in ackermann
function using recursion.1");

System.out.println("**************************n")
//calls for all values of ackerman using for loop
for(int i = 0; i < 6; i ++)
{
for(int j = 0; j < 10; j ++)
{
System.out.println("Ackerman (" + i + "," + j + ") is: " +
ack(i,j));
}
}

//test sinlge
//System.out.println(ack(3,1));
}

public static int ack(int m, int n)
{
if(m == 0)
{
return(n + 1);
}
else if(m > 0 && n == 0)
{
return(ack(m-1,1));
}
else if(m >0 && n > 0);
{
return(ack(m-1, ack(m,n-1)));
}
}
}

The Ackermann function is a classic example of a function that is not primitive recursive – you cannot solve it using loops like Fibonacci. In other words, you have to use recursion to solve for values of the Ackermann function.

## 0.1 Overview

DDR4 ram is the successor to DDR3 ram and has many benefits. DDR3 ram is currently what most computers use, and it came out in 2007.

## 0.2 What DRR4 Stand for:

Double Data Rate Fourth Generation Synchronous Dynamic Random-Access Memory