### 1. Parsons Problem, Mathematical Proof.

Create a proof of the theorem: If \(n\) is an even number, then \(n\equiv 0\mod 2\text{.}\)

## Hint.

Dorothy will not be much help with this proof.

Create a proof of the theorem: If \(n\) is an even number, then \(n\equiv 0\mod 2\text{.}\)

Dorothy will not be much help with this proof.

Parsons problems can specify a partial ordering that allows for multiple valid solutions.

Try putting the blocks in a valid order to calculate and print

`c`

Only use the required blocks. There are many valid orderings.The Sieve of Eratosthenes computes prime numbers by starting with a finite list of the integers bigger than 1. The first member of the list is a prime and is saved/recorded. Then all multiples of that prime (which not a prime, excepting the prime itself!) are removed from the list. Now the first number remaining in the list is the next prime number. And the process repeats.

The code blocks below can be rearranged to form one of the many possible programs to implement this algorithm to compute a list of all the primes less than \(250\text{.}\) [Ed. this version of this problem requires the reader to provide the necessary indentation.]

This reprises Exercise 2.5.1.

Parsons problems that have a

`language`

specified that corresponds to a valid activecode language can be made runnable.Complete the Python function

`isolateRed(p)`

If either the blue or green is higher than the red, average the three color values and set red, green, and blue to be that average. Otherwise, do nothing to `p`

.After you check a correct answer you will be able to Run the code you created - it will be used to modify the image shown below.

The Sieve of Eratosthenes computes prime numbers by starting with a finite list of the integers bigger than 1. The first member of the list is a prime and is saved/recorded. Then all multiples of that prime (which not a prime, excepting the prime itself!) are removed from the list. Now the first number remaining in the list is the next prime number. And the process repeats.

The code blocks below can be rearranged to form one of the many possible programs to implement this algorithm to compute a list of all the primes less than \(250\text{.}\) [Ed. this version of this problem does not require the reader to provide the necessary indentation, which is the default.]

This reprises Exercise 2.5.1.

Create a proof of the theorem: If \(n\) is an even number, then \(n\equiv 0\mod 2\text{.}\) [Ed. This version has numbered blocks, online they are on the right end of the block.]

Dorothy will not be much help with this proof.

The Sieve of Eratosthenes computes prime numbers by starting with a finite list of the integers bigger than 1. The first member of the list is a prime and is saved/recorded. Then all multiples of that prime (which not a prime, excepting the prime itself!) are removed from the list. Now the first number remaining in the list is the next prime number. And the process repeats.

The code blocks below can be rearranged to form one of the many possible programs to implement this algorithm to compute a list of all the primes less than \(250\text{.}\) [Ed. This version has numbered blocks, online they are on the left end of the block.]

This reprises Exercise 2.5.1.