Smallest number k such that k+2^m is composite for all m less than k: Difference between revisions

Content added Content deleted
m (julia example)
m (Promote. multiple implementations, no questions)
Line 1: Line 1:
{{draft task}}
{{task}}


Generate the sequence of numbers '''a(k)''', where each '''k''' is the smallest positive integer such that '''k + 2<sup>m</sup>''' is composite for every positive integer '''m''' less than '''k'''.
Generate the sequence of numbers '''a(k)''', where each '''k''' is the smallest positive integer such that '''k + 2<sup>m</sup>''' is composite for every positive integer '''m''' less than '''k'''.
Retrieved from "https://rosettacode.org/wiki/Smallest_number_k_such_that_k%2B2%5Em_is_composite_for_all_m_less_than_k"