← Complete problem index

PROJECT EULER · #0757

Stealthy Numbers

Statement only · SolvedOriginal problem ↗

A positive integer N is stealthy, if there exist positive integers a, b, c, d such that ab=cd=N and a+b=c+d+1.
For example, 36=4×9=6×6 is stealthy.

You are also given that there are 2851 stealthy numbers not exceeding 106.

How many stealthy numbers are there that don't exceed 1014?

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.