JR Galia

The factorial of a positive integer n, denoted by n!, is the product of all positive integers less than or equal to n. For example, 6! = 1 x 2 x 3 x 4 x 5 x 6 = 720. Below is a python program to identify this number.

1. open your source code in vim
        go to Applications >>> Accessories >>> Terminal
        then type vim <codeFileName> then hit Enter
        e.g vim factorial.py
2. convert your code to readable html
       type :runtime! syntax/2html.vim then hit Enter

A recursive function is a function that calls itself during its execution.

The factorial of a positive integer n, denoted by n!, is the product of all positive integers less than or equal to n. For example, 6! = 1 x 2 x 3 x 4 x 5 x 6 = 720.
 

Basket Note Pads is an open source note-taking software. It is an alternative to Microsoft One Note. Below is a screenshot of my notes.

I edit my previous post in fibonacci number to display the sequence up to nth number. I still used array to implement this problem. Future post will be fibonacci sequence using recursive function.

Fibonacci sequence/series is a sequence of numbers in which each successive number is equal to the sum of the preceding numbers.

The nth fibonacci number is:
fib(n) = fib(n-1) + fib(n-2); where fib(1) = 1 and F(2) = 1,

The first five numbers are 1, 1, 2, 3, 5

Below is a c program that will return the nth fibonacci number.

Follow the following simple steps to remove the unwanted navigation bar in your blogspot blog.

This is how to create xml in servlet:

File Heirarchy

index.jsp