Problem 4 from the Project Euler website. The Problem A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 x 99 Find the largest palindrome made from the product of two 3-digit numbers. My Solution First I did 999 x 999 to […]

# Tag: programming

## Finding Prime Numbers – Python

Problem 3 from the Project Euler website. The Problem The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143? My Solution WARING: It’s right…but not efficient at all. Don’t use – your computer will hate you. I’ll come back to this one when I […]

Problem 2 from the Project Euler website. The Problem Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … By considering the terms in the Fibonacci sequence […]

The output file will create something like this

## get.dates for linear graph – R

## Log Graph Function – R

This function takes an nCol file and returns L.C. Freeman’s Group Degree Centrality: Degree centrality (CD) can be calculated as follows: For the following graph we can count the number of connections (edges) each node has (its degree), The maximum degree is 3 for n1. Therefore we subtract the other node degrees from this Then […]

You must be logged in to post a comment.