olymmath

AHSME 1960 Problem 33

    You are given a sequence of 5858 terms; each term has the form P+nP+n where PP stands for the product 2×3×5×…×612 \times 3 \times 5 \times\ldots \times 61 of all prime numbers less than or equal to 6161, and nn takes, successively, the values 2,3,4,…,592, 3, 4,\ldots, 59. Let NN be the number of primes appearing in this sequence. Then NN is: (A) 0(B) 16(C) 17(D) 57(E) 58\textbf{(A)}\ 0 \textbf{(B)}\ 16 \textbf{(C)}\ 17 \textbf{(D)}\ 57 \textbf{(E)}\ 58

    Dataset text NuminaMath-1.5. Quoted with source.

    Show the answer

    0

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator ahsme/1960/p33 · Tag APQA6BJA1N · Edit this page on GitHub · Keys: j next, k previous