1994 is 9^{2} * 2^{2,} so I’d guess no, it is not :)

You should probably explicitly state the goal is to find all possible Francescos, but still, the bruteforce for this task is fine since I do not even need a paper to give the answer(s).

Metaproblem: restate the problem so that it has a determined answer.

An honors pupil Francesco was born in a year where the product of the digits of the year equals the square of some natural number, n. The year is now 2005, and he's waiting for the year when his age will be equal to that natural number, n. In how many years will Francesco celebrate the date?

## re: Compute Smart, Not Hard VIEW POST

TOP OF THREAD FULL DISCUSSION1994 is 9

^{2}* 2^{2,}so I’d guess no, it is not :)You should probably explicitly state the goal is to find

allpossible Francescos, but still, the bruteforce for this task is fine since I do not even need a paper to give the answer(s).(I don't want to give away the game ;)...)

1988 is 3

^{2}* 8^{2,}and that's it.Is there a way to hide the solution? PerlMonks have

`<readmore>`

and`<spoiler>`

.`1800`

beware of optimists :-PMetaproblem: restate the problem so that it has a determined answer.

→ 7