freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-48-self-powers.spanish.md

id	challengeType	title	videoUrl	localeTitle
5900f39c1000cf542c50feaf	5	Problem 48: Self powers		Problema 48: los poderes propios

Description

La serie, 1 ¹ + 2 ² + 3 ³ + ... + 10 ¹⁰ = 10405071317. Encuentre los últimos diez dígitos de la serie, 1 ¹ + 2 ² + 3 ³ + ... + 1000 ¹⁰⁰⁰ .

Instructions

Tests

tests:
  - text: '<code>selfPowers(10, 3)</code> debe devolver 317.'
    testString: 'assert.strictEqual(selfPowers(10, 3), 317, "<code>selfPowers(10, 3)</code> should return 317.");'
  - text: '<code>selfPowers(150, 6)</code> debe devolver 29045.'
    testString: 'assert.strictEqual(selfPowers(150, 6), 29045, "<code>selfPowers(150, 6)</code> should return 29045.");'
  - text: '<code>selfPowers(673, 7)</code> debe devolver 2473989.'
    testString: 'assert.strictEqual(selfPowers(673, 7), 2473989, "<code>selfPowers(673, 7)</code> should return 2473989.");'
  - text: '<code>selfPowers(1000, 10)</code> debe devolver 9110846700.'
    testString: 'assert.strictEqual(selfPowers(1000, 10), 9110846700, "<code>selfPowers(1000, 10)</code> should return 9110846700.");'

Challenge Seed

function selfPowers(power, lastDigits) {
  // Good luck!
  return true;
}

selfPowers(1000, 10);

Solution

// solution required