Decimal integers with nonzero digits and sum of powers puzzle

  • Context: Graduate 
  • Thread starter Thread starter K Sengupta
  • Start date Start date
  • Tags Tags
    Integers Puzzle Sum
Click For Summary

Discussion Overview

The discussion revolves around finding all possible positive decimal integers P, composed of nonzero digits, that satisfy the equation P = X1^X1 + X2^X2 + ... + Xn^Xn. The scope includes mathematical reasoning and problem-solving related to properties of digits and their powers.

Discussion Character

  • Mathematical reasoning
  • Exploratory
  • Debate/contested

Main Points Raised

  • Participants clarify that X1, X2, ..., Xn represent individual digits of P.
  • There is a question about whether digits can be repeated in P.
  • One participant notes that the problem states P cannot have leading zeros or any zeros at all.
  • A partial solution is presented, but it is acknowledged that it may not be complete and that all digits must be distinct.
  • There is a discussion about the interpretation of 0^0, with differing views on whether it equals 0 or 1.
  • A participant suggests an upper bound for P, estimating it to be around 3.4 billion, based on the growth rates of the sum of powers versus the number itself.
  • One participant mentions finding only 2 solutions, indicating a potential limitation in their approach.

Areas of Agreement / Disagreement

Participants generally agree on the interpretation of the digits and the constraints of the problem, but there are differing views on the treatment of 0^0 and the completeness of the solutions found. The discussion remains unresolved regarding the full set of possible solutions.

Contextual Notes

Limitations include the assumption about the distinctness of digits and the interpretation of 0^0, which may affect the validity of the proposed solutions. The upper bound estimation is also based on certain assumptions about growth rates.

K Sengupta
Messages
113
Reaction score
0
Determine all possible positive decimal integer(s) P = X1X2X3….Xn, where P>=2 with none of the digits in P being zero, that satisfy this equation:

P = X1^X1 + X2^X2 + ……+ Xn^Xn

(For example, P = 234 cannot be a solution since 2^2 + 3^3 + 4^4 is equal to 287, not 234.)

Notes:

(i) X1X2X3….Xn denotes the concatenation of the digits X1, X2, …, Xn and do not represent the product of the digits.

(ii) P cannot admit any leading zero.
 
Mathematics news on Phys.org
I'm assuming that X1, X2, X3 are all the individual *digits* of P?

DaveE
 
Last edited:
davee123 said:
I'm assuming that X1, X2, X3 are all the individual *digits* of P?

DaveE

Yes, each of X1,X2, ...,Xn correspond to an individual digit of P.
 
Can any digit be the same as another digit?
 
K Sengupta said:
(ii) P cannot admit any leading zero.
...or presumably, any other zeros.
 
Here are a few:
1
3435
438579088
Of these only the first meets the unstated condition that all digits be distinct. The third one fails to meet the unstated condition that no digits be 0. I used a brute force method to get this partial solution. I do not know if this list is complete.
 
That also assumes that 0^0 = 0-- I thought the more accepted solution was that 0^0 = 1?

Otherwise, I think there's an upper bound of roughly 3.4 billion. Beyond that I think the rate at which the sum of the powers increases is capped (since 9^9 is the highest sum a digit can contribute), and the number itself is increasing more quickly.

DaveE
 
davee123 said:
That also assumes that 0^0 = 0-- I thought the more accepted solution was that 0^0 = 1?

Good catch. There was a bug in my code. So I have only found 2 solutions.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 3 ·
Replies
3
Views
8K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 9 ·
Replies
9
Views
2K