Fibonacci Sequence Machine

Problem-based Digital Making Tasks

  1. To generate terms of Fibonacci Sequence and observe its parity. 

How CT may Support Mathematics Learning

Recursive repetition will support the generation of terms in the Fibonacci Sequence. Problem solving will be encountered with the first two entries of the Fibonacci Sequence being 1 and 1. Naming of two variables will be necessary.  

Possible Solution

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s