freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-457-a-polynomial-modulo-the-square-of-a-prime.spanish.md

id, localeTitle, challengeType, title

id	localeTitle	challengeType	title
5	5900f5361000cf542c510048	5	Problem 457: A polynomial modulo the square of a prime

Description

Sea f (n) = n2 - 3n - 1. Sea p un primo. Sea R (p) el entero positivo n más pequeño, de modo que f (n) mod p2 = 0 si existe tal entero n, de lo contrario R (p) = 0.

Sea SR (L) sea ∑R (p ) para todos los números primos que no excedan de L.

Encuentre SR (107).

Instructions

Tests

tests:
  - text: <code>euler457()</code> debe devolver 2647787126797397000.
    testString: 'assert.strictEqual(euler457(), 2647787126797397000, "<code>euler457()</code> should return 2647787126797397000.");'

Challenge Seed

function euler457() {
  // Good luck!
  return true;
}

euler457();

Solution

// solution required