Some Summed Digits In A 9-Digit Positive Integer

  • Context: Undergrad 
  • Thread starter Thread starter K Sengupta
  • Start date Start date
  • Tags Tags
    Integer Positive
Click For Summary
SUMMARY

The discussion centers on finding a unique 9-digit positive integer that utilizes each decimal digit from 1 to 9 exactly once while satisfying specific summation conditions. The conditions include sums of digits between specified positions equaling 9, 20, 45, 18, and a requirement that the 8th digit is less than the 2nd digit. Additionally, the user proposes exploring non-decimal bases between 11 and 16 for potential solutions, expanding the problem's complexity.

PREREQUISITES
  • Understanding of combinatorial mathematics
  • Familiarity with digit manipulation in number theory
  • Knowledge of base number systems, specifically bases 11 to 16
  • Experience with logical reasoning and problem-solving techniques
NEXT STEPS
  • Research combinatorial problem-solving techniques in number theory
  • Explore the properties of base number systems, particularly bases 11 to 16
  • Learn about digit sum properties and their applications in mathematical puzzles
  • Investigate unique digit arrangements and their constraints in combinatorial contexts
USEFUL FOR

Mathematicians, puzzle enthusiasts, educators in number theory, and anyone interested in combinatorial logic and digit manipulation challenges.

K Sengupta
Messages
113
Reaction score
0
Determine a 9-digit positive integer that uses each of the decimal digits from 1 to 9 exactly once, such that:

(i) The sum of the digits 1 and 2 and all the digits between them is 9.

(ii) The sum of the digits 2 and 3 and all the digits between them is 20.

(iii) The sum of the digits 3 and 4 and all the digits between them is 45.

(iv) The sum of the digits 4 and 5 and all the digits between them is 18.

(v) The sum of the digits 8 and 9 and all the digits between them is more than 32.

(vi) The 8th digit is less than the 2nd digit.
 
Mathematics news on Phys.org
495162783
 
Well done JS !

I came across this problem in a puzzle periodical. However, the original version only provided clues (i) to (iv). I added clues (v) and (vi) on my own with a view to eliciting an unique solution.

I am just thinking aloud, but keeping all the other conditions unaltered, that is, 9-digit positive integer, using all the digits 1 to 9 exactly once, and so on ……, are there positive nondecimal integer base(s) A, with 11<= A <= 16, such that A gives at least one valid solution to the given problem !
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
1
Views
1K