Pairs with common factors: Difference between revisions

Content added Content deleted
(Added Algol W)
m (Remove draft tag. Draft for over a year, multiple implementations, little controversy)
Line 1: Line 1:
{{draft task}}
{{task}}


Generate the sequence where each term '''n''' is the count of the pairs '''(x,y)''' with '''1 < x < y <= n''', that have at least one common prime factor.
Generate the sequence where each term '''n''' is the count of the pairs '''(x,y)''' with '''1 < x < y <= n''', that have at least one common prime factor.
Retrieved from "https://rosettacode.org/wiki/Pairs_with_common_factors"