Coprime triplets: Difference between revisions

Content added Content deleted

Inline

@@ Line 2: / Line 2: @@
 ;Task:
-Find and show the smallest number which is coprime to the last two predecessors and has not yet appeared; a(1)=1, a(2)=2.
+Starting from the sequence a(1)=1 and a(2)=2 find the next smallest number which is coprime to the last two predecessors and has not yet appeared yet in the sequence.
 <br>p and q are coprimes if they have no common factors other than 1.
 <br> Let '''p, q < 50'''