Monkey Raptor V.2

Posts

Showing posts from January, 2013

Show all

Sleeping Moth

The photos were taken in the morning.

✒️ Edit

Half-Assed Comic Strip: Morning Coffee

Another comic strip! This was inspired by anything and everyone.

✒️ Edit

Math: Finding GCF and LCM Using Continuous Division (Translated to JavaScript)

Hi! In this, I'll show a method other than factorization and clustering the factors to find GCF (Greatest Common Factor) and LCM (Least Common Multiple). I assume you're familiar with the first method. That is using tree factors and then grouping the dilly. I was taught to do this method in elementary school. The method has already been translated to an application on Port Raptor: GCFLCM.C . There's an explanation about the method flow on that post too. Let's start to implement the continuous division method. For example, we want to find GCF and LCM from: 8, 16, 18 Method: Create a table and write down those numbers as first row. Give some space for vertical column on the leftmost. The leftmost column will be used to list the divisor. The cells between the first row and first column are the division results (quotients). The division goes diagonally. Start with the division with 1, well... Then, divide starting from the lowest prime number → 2. If an e...

Monkey Raptor V.2

Search This Blog

Posts

Sleeping Moth

Half-Assed Comic Strip: Morning Coffee

Found a moth

JavaScript: REFERRER

Health: Stomach Ulcer and Food Poisoning Quick Treatment

Legion

CSS: Aspect Ratio

Math: Finding the Shortest Grid Paths Possibilities

Blogger Template Formatting: The Secret to Perfect Indentation

JavaScript: How to Detect if an Element Exists?

Blogger Conditional Tag — b:if and b:else

Math: Finding GCF and LCM Using Continuous Division (Translated to JavaScript)

Tool: Lere and Woju