Project Euler – Problem 206 Solution

Yan Cui

I help clients go faster for less using serverless technologies.

Problem

Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0,

where each “_” is a single digit.

Solution

Initially I started solving this problem by creating all permutations of 19 digits numbers which fits the required pattern and iteratively square rooting them to find a square root which is a whole number. Unfortunately thanks to rounding errors this approach doesn’t give me the correct answer so I resorted to iterating through the square roots and brute forcing it instead.

Whenever you’re ready, here are 3 ways I can help you:

  1. Production-Ready Serverless: Join 20+ AWS Heroes & Community Builders and 1000+ other students in levelling up your serverless game. This is your one-stop shop for quickly levelling up your serverless skills.
  2. I help clients launch product ideas, improve their development processes and upskill their teams. If you’d like to work together, then let’s get in touch.
  3. Join my community on Discord, ask questions, and join the discussion on all things AWS and Serverless.

Leave a Comment

Your email address will not be published. Required fields are marked *