Coincidence Numbers

Problem

For a positive integer nn, let s(n)s(n) be the sum and p(n)p(n) the product of its digits. Call nn a coincidence number if

s(n)+p(n)=n.s(n) + p(n) = n.

Find the sum of all coincidence numbers.

Answer

Solution

Difficulty6/10
TopicsDiophantine Equations, number theory, Casework

Whiteboard

Your sketch is saved only in this browser. To share it, export your drawing as an image (whiteboard menu → Export as → PNG), then upload that image in the comments below.

Discussion

Ask questions, share alternate solutions, and use LaTeX freely.

0 comments
Log in to join the discussion.

No comments yet.