Difference between revisions of "W1173 Finding Primes"

From Coder Merlin
 
(3 intermediate revisions by one other user not shown)
Line 1: Line 1:
[[File:Euclid's algorithm Book VII Proposition 2 3.png|thumb|link=|Euclid's Algorithm]]
[[File:Primes-vs-composites.svg|thumb|link=|Primes-vs-composites]]
== Prerequisites ==
== Prerequisites ==
* [[W1151 Conditional and Flow Chart]]
* [[W1152 While Loop]]
* [[W1153 Repeat-While Loop]]
* [[W1154 For Loop]]
== Background ==
== Background ==
[https://en.wikipedia.org/wiki/Euclidean_algorithm Euclidean Algorithm] (Wikipedia)
[https://en.wikipedia.org/wiki/Prime_number Prime Number] (Wikipedia)
<br clear='all'/>
<br clear="all" />
== Exercises ==
== Exercises ==
{{W1173-Exercises}}
{{Exercises|
* {{MMMAssignment|M1173-10}}
* {{MMMAssignment|M1173-20}}
}}

Latest revision as of 11:33, 28 November 2021

Within these castle walls be forged Mavens of Computer Science ...
— Merlin, The Coder
Primes-vs-composites

Prerequisites[edit]

Background[edit]

Prime Number (Wikipedia)

Exercises[edit]

ExercisesExercisesIcon.png
  •  M1173-10  Complete  Merlin Mission Manager  Mission M1173-10.
  •  M1173-20  Complete  Merlin Mission Manager  Mission M1173-20.