The Search for an 'A' Whose Powers All Start with 9

  • MHB
  • Thread starter Albert1
  • Start date
  • Tags
    Search
In summary, "The Search for an 'A' Whose Powers All Start with 9" is a mathematical problem that involves finding an integer 'A' that, when raised to any power starting with 9, will result in a number with all digits being 9. This problem is significant because it has not yet been solved and has been a topic of interest for mathematicians for many years. As of now, there is no known solution to this problem, but there have been some findings and strategies proposed by mathematicians. If this problem is solved, it could potentially lead to a better understanding of perfect powers and repunit numbers, as well as have practical applications in cryptography and security systems. However, there are limitations in solving this
  • #1
Albert1
1,221
0
Prove it is possile to find a number $A$
Where $A\in N ,\,\,A>1$ and
the first digit of $A,A^2,A^3,...,A^{2015} $ is 9
and find one such number $A$
 
Mathematics news on Phys.org
  • #2
Albert said:
Prove it is possile to find a number $A$
Where $A\in N ,\,\,A>1$ and
the first digit of $A,A^2,A^3,...,A^{2015} $ is 9
and find one such number $A$

if we choose $A = x * 10^n$ form some n then we have for any k ( x < 1)

$A^{k} = x^k * 10^{nk}$
for $A^k$ to start with 9 we choose

$1 > x^k >= .9$
if for k = 1 to 2015 above condition to be met then we must have

$x^2015 >= .9$ or $x >= .9^{\frac{1}{2015}}$
we can find the x from above and multiply by 10 repeatedly till we find all 9's before the decimal and one more digit and add 1.

for example say upto A and $A^2$
$x= .9^.5 = .948$
so we can take A = 95
$95 = 95, 95^2 = 9025$ both leading 9

one such number shall be 99995 because $.9^{\frac{1}{2015}} = .99994...$
 
Last edited:

FAQ: The Search for an 'A' Whose Powers All Start with 9

What is "The Search for an 'A' Whose Powers All Start with 9"?

"The Search for an 'A' Whose Powers All Start with 9" is a mathematical problem that involves finding an integer 'A' that, when raised to any power starting with 9, will result in a number with all digits being 9.

What makes this problem significant?

This problem is significant because it has not yet been solved and has been a topic of interest for mathematicians for many years. It also has connections to other mathematical concepts such as perfect powers and repunit numbers.

What is the current progress on solving this problem?

As of now, there is no known solution to this problem. However, there have been some findings and strategies proposed by mathematicians, but none have been proven to be a definitive answer.

What are some potential applications of solving this problem?

If this problem is solved, it could potentially lead to a better understanding of perfect powers and repunit numbers. It could also have practical applications in cryptography and security systems.

Are there any known limitations or restrictions in solving this problem?

One limitation is that the integer 'A' must be a positive integer, as negative integers raised to powers starting with 9 will result in a negative number. Also, the solution must be a finite integer, not a decimal or irrational number.

Similar threads

Replies
3
Views
1K
Replies
14
Views
2K
Replies
11
Views
2K
Replies
1
Views
2K
Replies
1
Views
1K
Replies
7
Views
1K
Replies
2
Views
1K
Replies
7
Views
550
Back
Top