Arbitrary digit of an exponential number

  • Thread starter Thread starter cap.r
  • Start date Start date
  • Tags Tags
    Exponential
cap.r
Messages
64
Reaction score
0
I am looking to find an arbitrary digit of let's say 23^234. This one has 219 digits. so let's find the 187th digit...

This isn't homework or anything, I just think it would be interesting and I couldn't find it on google. I would rather use simple number theory that can be taught to a college student. but if this requires more math, go ahead and use whatever you need.
 
Physics news on Phys.org
There's no easy way to do it. However, note that the last N digits in the sequence 23, 23^2, 23^3, 23^4, ... must eventually repeat. For 23, the length between repeats is 4*5^(N-1). So all you need to do to find the 187th digit in 23^234 is to print out that list of 4*5^(219-187-1) numbers and use modulo arithmetic to figure out where in that list your desired digit is. ;o)
 
interesting... How do I get the formula for finding repeating length in an arbitrary exponential X^N.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
It is well known that a vector space always admits an algebraic (Hamel) basis. This is a theorem that follows from Zorn's lemma based on the Axiom of Choice (AC). Now consider any specific instance of vector space. Since the AC axiom may or may not be included in the underlying set theory, might there be examples of vector spaces in which an Hamel basis actually doesn't exist ?
Back
Top