Testwiki:Reference desk/Archives/Mathematics/2016 August 8
From testwiki
Revision as of 03:04, 15 August 2016 by imported>Scsbot (edited by robot: archiving August 8)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Template:Error:not substituted
{| width = "100%"
|- ! colspan="3" align="center" | Mathematics desk |- ! width="20%" align="left" | < August 7 ! width="25%" align="center"|<< Jul | August | Sep >> ! width="20%" align="right" |Current desk > |}
| Welcome to the Wikipedia Mathematics Reference Desk Archives |
|---|
| The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
Contents
August 8
b^a=ab ?
and . Are there other examples where is written in decimal notation? Bo Jacoby (talk) 14:53, 8 August 2016 (UTC).
- My brute-force script says no for . That is not an elegant solution, but it seems easy to prove that there is no such pair of integers for a>1 and b sufficiently large (the number of digits alone will not match), and the a=0,1 cases are trivial to do. TigraanClick here to contact me 15:14, 8 August 2016 (UTC)
- If you allow different bases then you get a number of other examples, such as 33 = 33 (base 8), 43=34 (base 20). You get a solution for a=2 exactly when the base is a triangular number (such as 10). From sketching the graph it appears that there are only a finite number of solutions for a given base, assuming a and b are non negative integers. If you allow negative integers then ba=10a+b also has the solution b=-4, a=2. --RDBury (talk) 19:20, 8 August 2016 (UTC)