A positive integer pair
, is called an "almost twin prime pair", if one of the pair is a prime and the other is either a prime or a semiprime. A semiprime is a natural number that is a product of only two and exactly two (not necessarily distinct) prime numbers (e.g. 4, 6, 9,
,
,
,
,
,
...).
Listed below are all almost twin prime pairs with no element greater than
:
Our task in this exercise is, to create a function that counts the number of almost twin prime pairs whose elements are less than or equal to a given limit
Therefore for
, our function should return
.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers5
Suggested Problems
-
The Goldbach Conjecture, Part 2
2417 Solvers
-
213 Solvers
-
11258 Solvers
-
Compute a row of the Kimberling shuffle
14 Solvers
-
Count the ways to draw non-intersecting chords between points on a circle
12 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!