Hey there everybody,
Hope you are well ! First time posting here as i am somewhat new to the programming world. I am currently using C++ and wish to write a code for the following issue. Please study the below and let me know of your thoughts and how you would approach this. Many thanks in advance for having a look.
Kindest Regards
I wish to write down a code which would assist me in finding all the 8 digit numbers that when their each individual digit gets raised on a power (any power) and then summed the initial number would occur. The individual digits would all be raised on the same value power.
Looking forward to your responses on this.
