Decimal and nondecimal almost perfect squares of the form aaabbb

  • Context: Graduate 
  • Thread starter Thread starter K Sengupta
  • Start date Start date
  • Tags Tags
    Form Squares
Click For Summary
SUMMARY

This discussion identifies positive decimal integers of the form aaabbb that become perfect squares when 1 is added. The valid solutions include 111555 and 444888 in base 10, 111333 in base 5, 222666 in base 9, 333999 in base 13, and 555888 in base 16. The analysis reveals that for bases S up to 16, specific conditions must be met, including the divisibility of N-1 and N+1 by 37. A computer program was utilized to explore over 30 cases, confirming the existence of multiple solutions across different bases.

PREREQUISITES
  • Understanding of perfect squares and integer properties
  • Familiarity with number bases up to base 16
  • Basic programming skills for algorithmic exploration
  • Knowledge of divisibility rules, particularly for 37
NEXT STEPS
  • Explore the properties of perfect squares in different number bases
  • Learn about divisibility rules and their applications in number theory
  • Investigate algorithms for generating and testing integer sequences
  • Study the implications of base conversions on integer properties
USEFUL FOR

Mathematicians, computer scientists, and hobbyists interested in number theory, particularly those exploring integer sequences and perfect squares in various bases.

K Sengupta
Messages
113
Reaction score
0
Determine all possible positive decimal integer(s) of the form aaabbb, each with no leading zeroes, that becomes a perfect square when 1 is added to it.

What are the positive nondecimal integer base(s) S, with S<=16, such that S admits at least one valid solution in conformity with the given conditions?

Note: a cannot be equal to b.
 
Mathematics news on Phys.org
Let the perfect square = [tex]N^2[/tex]. We have

[tex]N^2[/tex] = aaabbb + 1
(N+1)(N-1) = 111 X a00b
= 111(999a+a+b)

If 9a is a perfect square, say [tex]c^2[/tex], then by choosing N=ccc+1 and b=2c-a, the above equation will be satisfied.

Since aaabbb must be in the range 111000 to 999888, N must be in the range 334 to 999. Thus a can only assume values 1 and 4, with c = 3 and 6 respectively. Indeed, 111555 and 444888 are solutions.

However, N may not necessarily be of the form ccc+1. Although we only need to consider the cases when (N-1) is divisible by 37 and cases when (N+1) is divisible by 37, we still have 30+ cases to consider.

I can't find a way to substantially reduce the number of cases to consider, so I wrote a simple computer program to try them out. The solutions are:

base 5: aaabbb = 111333, N = 223
base 9: aaabbb = 222666, N = 445
base 10: aaabbb = 111555, N = 334; aaabbb = 444888, N=667
base 13: aaabbb = 333999, N = 667
base 16: aaabbb = 555888, N = 93D

As seen in the case of base 16, N is not of the form ccc+1. So it seems that many separate cases have to be considered.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 27 ·
Replies
27
Views
3K