This project computes Factorial N written as N!

Here is the definition of Factorial N.

Writing code is not a one-step process. Over the years I've found that breaking the coding process into three parts helps students understand that first of all, coding is an exercise in problem-solving and breaking the coding problem into a series of smaller problems is the most efficient method for coding.

Here are the three Parts and seven Steps I encourage students to use when coding.

**I Do the Math with Paper & Pencil Part**

•
(1) Analyze the problem

**II Do the Algebraic Thinking Part**

•
(2) Identify the variables

•
(3) Determine the relationships between the variables

**III Do the Algorithmic Thinking Part**

•
(4) Create a Logic Flow diagram

•
(5) Translate the relationships (math syntax) into (computer

syntax)

syntax)

•
(6) Combine the pieces of code (into the algorithm that solves

the problem)

the problem)

•
(7) Test the algorithm (debug)

I describe in detail how to apply this method to the problem of coding a Factorial algorithm in a six-page document. Any interested reader can obtain a copy of this copyright-free document in pdf format by sending an email to grandadscience@gmail.com

Here is the opening screen of the project. The user is asked to input N! The number 11 was typed into the blue-lined box at the bottom of the screen.

I describe in detail how to apply this method to the problem of coding a Factorial algorithm in a six-page document. Any interested reader can obtain a copy of this copyright-free document in pdf format by sending an email to grandadscience@gmail.com

Here is the opening screen of the project. The user is asked to input N! The number 11 was typed into the blue-lined box at the bottom of the screen.

In this picture the computation of 11! is reported as 39,916,800.

This project can be viewed and downloaded by clicking on the following link to the Scratch web site.

https://scratch.mit.edu/projects/87399897/