Fibonacci Series in Java

Java code written to count and output the Fibonacci sequence.

// Algorithm for Adding Fibonacci Numbers

// @author www.mikestratton.net
public class Fibonacci
{

public static void main(String[] args)
{

int count = 20; // set the number of times the equation runs ** do not exceed 44
int x = 0; int y = 1; // set the initial values to be added
int fib = 0; //  fibonacci number

for (int i = 0; i <= count; i++)
{
fib = x + y;
Read more →

0

C# Version 5.0 Keywords

C# Version 5.0 Keywords

A full list of C# Version 5.0 keywords, including contextual keywords.

abstract
as
base
bool
break
byte
case
catch
char
checked
class
const
continue
decimal
default
delegate
do
double
else
enum
event
explicit
extern
false
finally
fixed
float
for
foreach
goto
if
implicit
in
int
interface
internal
is
lock
long
namespace
new
null
object
operator
out
override
params
private
protected
public
readonly
ref
return
sbyte
sealed
short
sizeof
stackalloc
static
string
struct
switch
Read more →
0

Discrete Math: Functions

Define: Functions

Let A and B be nonempty sets. A function f   from A to B, which is denoted f: A –> B, is a relation from A to B such that all a ∈ Dom(f), f(a), the f-relative set of a, contains just one element of B. Naturally, if a is not in Dom(f), then f(a) = ∅. If f(a) = {b}, it is traditional to identify the set {b} with the element b and write f(a) = b.

Simplified Definition: Functions

Definition 1.a: ...

Read more →
0

The Pigeonhole Principle

The following excerpt was taken from:
Kolman, Busby, & Ross(2009), Discrete Mathematical Structures, 6th ed. Upper Saddle River, NJ: Pearson Prentice Hall

“Theorem: The Pigeonhole Principle

The Pigeonhole Principle is a proof technique that often uses discrete math’s counting methods.

If n pigeons are assigned to m pigeonholes, and m < n, then at least one pigeonhole contains two or more pigeons.

Pigeonhole Principle – Proof

Suppose each pigeonhole contains at most 1 pigeon. Then at most m pigeons have been assigned. But since m ...

Read more →
0

Discrete Math Resources

This post was created to list resources for undergraduate students who are taking a course related to discrete mathematical structures. The links listed here should be used for to learn the fundamentals of discrete mathematical structures.

Discrete Math – Text Based Tutorials

Sets:
http://www.mathsisfun.com/sets/sets-introduction.html

Matrices:
http://home.scarlet.be/math/matr.htm

Propositions & Logical Operations:
http://www.stat.berkeley.edu/~stark/SticiGui/Text/logic.htm

Methods of Proof:
http://www.mathpath.org/proof/proof.methods.htm

Mathematical Induction:
http://people.richland.edu/james/lecture/m116/sequences/induction.html

Combinations and Permutations:
http://www.mathsisfun.com/combinatorics/combinations-permutations.html

Pigeonhole Principle:
http://www.cut-the-knot.org/do_you_know/pigeon.shtml

New York State University – Power Point Presentation:
http://cs.nyu.edu/courses/summer03/G22.2340-001/index.htm
Read more →

0

Fundamentals of Discrete Math

Fundamentals of Discrete Mathematical Structures

This post contains a synopsis of the fundamentals of discrete mathematical structures. This post was created during my second year of college while studying to attain a Bachelors of Science in Computer Science.  The discrete math course is a necessary requirement in attaining a B.S. in Computer Science.

“The origins of matrices goes back to approximately 200 B.C.E, when they were used by the Chinese to solve linear systems of equations” (Kolman, Busby, & Ross, 2009).

Are you interested in ...

Read more →
0
Page 4 of 9 «...23456...»