Talk:Sum of square and cube digits of an integer are primes

The way the question is worded, it seems to be asking us to take the digits of the number, add up their squares then add up their cubes, and if the two sums are primes output the number. But the solutions already present square and cube the numbers and just find the digit sum. This is vaguely worded. Thebigh (talk) 23:03, 21 December 2021 (UTC)

I did it all wrong first try too, feel free to change it. Maybe (this is supposed to be a quite/quiet gentle poke that I know won't work, or even is from PE) it should read:

Take random Project Euler entry, pass through Google Translate or similar umpteen times, eg -> French -> Haitian -> Maori -> Welsh -> English, and post as a task here.

Or maybe "Sum of thought and care in copy Project Euler is zero, where n < e[1] could do that".

I will reiterate my call for a {{trivial task}} tag, that does not affect task counts or land on "not implemented" pages. --Pete Lomax (talk) 09:42, 22 December 2021 (UTC)

I wouldn't take much notice of how Calmosoft words his task descriptions, as his first language is not English. I'd just read the Ring code instead to find out what's intended. Anyway, I've altered the task description so that, hopefully, it's clear now what's needed. --PureFox (talk) 14:50, 22 December 2021 (UTC)

Personally, I thought "sum of the cubes of the digits" is potentially more interesting. At least once you go above 100; below 100 the only solution was 11. Thebigh (talk) 19:40, 22 December 2021 (UTC)