find the period of \(\large 1/83 \) in its decimal expansion
what is period mean here?
is that just any repeating part that might occur in the expansion?
period is the length of the repeating part... example : the period of 1/37 is 3 because 1/37 = 0.027027027...
the length of the repeating part
82
This one is going to be pretty tough without any tricks because it it is suppose to be 41. :p
how did you get 82
\((10^{41}-1) \pmod {83}=0\)
yes both 41 and 82 are periods.. but 41 is the smallest one actually i think we can say any multiple of 41 is a period
also \((10^{82}-1) \pmod {83}=0\)
fermat little theorm
interesting, whats that and does that work
and how did u get 41 @myininaya
Ohh I see.. how is that related to period ?
found here http://hr.userweb.mwn.de/numb/period.html the length of period of the denominator \(q\) should divide \(10^{k}-1\)
lol I was trying to find a trick how to get 41
but sometimes \(\Large m^{\phi (n)} =m^{\phi(n)/2} \equiv 1 \pmod q\)
\(\Large m^{\phi (n)} =m^{\phi(n)/2} \equiv 1 \pmod n\)
\[(10^{x}-1) \pmod {n}=0\] so finding x here will give us the period for 1/n ---would this work for all n and x
no u have to check the earlier powers to specially its \(\phi(n)/2\)
n = 0.abcdef abcdef abcdef ... 10^6n=abcdef.abcdef abcdef abcdef ... -------------------------------------- 10^6n-n = abcdef n(10^6-1) = abcdef yeah it seem to work in general xD
@mathmath3333 is such a wiz
\(\phi(83) = 82\) and only factors of \(82\) are \(2\) and \(41\) so only possible candidates of period are : \(\{2,41,82\}\) is that how you figured out @mathmath333
i searched "wiz" on google
yes this one
By similar reasoning, the period of 1/7 has to be 6 or any factors of 6 ?
example in \(1/73\) its period of 8 and 72=8*9 there is obvious relation with it
nice nice for finding the period of \(\large \dfrac{1}{p}\), we can simply try the factors of \(\large p-1\)
\[\frac{1}{43} \\ p=43 \\ p-1=42=6 \cdot 7 \] And how do you continue from here I'm still confused
wait so those are the only candidates for the equation given by @mathmath333
\(\Large (10^{\text{try every factor of 42}} -1)\pmod {43} =0\)
the lowest will be the answer
\[(10^x-1) (\mod p)=0 \\ (10^6-1)( \mod 43) \neq 0 \\ (10^7-1)(\mod 43) \neq 0 \\ (10^{21}-1)(\mod 43)=0\] I think I get it so the period of 1/43 is 21
yes
thats it i guess just a side observation.. once we know that \((10^{21}-1)(\mod 43)=0\), below is also trivially true \[(10^{21x}-1)(\mod 43)=0\]
That will get scarier for numbers with bigger denominators
not if its multiple choice question
completely agree! but thats the best known method we have so far it seems..
Though I guess that is the point in why they choose big numbers in encryption it runs more difficulty of us using mathematics to get the right key
yeah solving \(10^x \equiv a\pmod {p}\) is a discrete logarithm problem - the most hardest problem for computers... these are used in cryptography .. solve below problem for $100,000,000 :P http://unsolvedproblems.org/index_files/RSA.htm
That number is crazy and I dare @mathmath333 to take on the challenge and give me half his award :p
i would rather play chess tournaments and gather more
jk
Woah thats not fair, i deserve half and you both can share 25 lol btw it is given, that number has only two factors
Nothing is fair when it comes to women
I do have one real question on this problem
earlier to find x I was just pluggin in numbers and seeing which gave me remainder 0
I guess that is the best way ?
there is a small trick..
or the best way we know of
do tell :0
primitive roots ?
from the fermat we know that \[10^{82}\equiv 1 \pmod{83}\]
so \(10^{41}\) has to leave a remainder of \(\pm 1\) because : \[10^{82}\equiv 1 \pmod{83}\] \[10^{82}- 1 \equiv 0 \pmod{83}\] \[(10^{41}- 1)(10^{41}+1) \equiv 0 \pmod{83}\]
if \(10^{41}\) leaves a remainder of \(-1\), then we're sure that the period is \(82\)
that is kinda weird the period for 1/83 is (83-1)/2 and the period 1/43 is (43-1)/2
the period of 1/97 is 96
can i substitute any primitive root of 83 for 83
But it must be true for some integer n that 1/n has period (n-1)/2 and if so I wonder if we can give the set of numbers n such that is true:
thats too long 96
1/13 has period (13-1)/2
thats an interesting question primitive roots are also a good idea
is \(n\) a prime in \(1/n\) ?
It seems to be prime so far I'm just trying to find a set of numbers such that 1/n has period (n-1)/2
but not all primes
1/23 doesn't have period (23-1)/2
Ohhk.. im not even sure if we can say the period function is one-to-one or one-to-many hmm
the (n-1)/2 will not work every time u have to check it
say f(p) gives the period of 1/p in the decimal expansion where p is a prime it looks like f(p) is one-to-one...idk not so sure..
can we find two primes with same period ?
1/2 and 1/3 have period 1 right?
or can you say 1/2 has period 1
it doesn't repeat
or i mean it terminates
i think the primitive root will not work http://www.wolframalpha.com/input/?i=10%5E%2896%29+mod+5%3D and 5 is primitive root of 97
2 is even it wont repeat
2 is also prime
Ohkk.. then there can be more than one prime having the same period
so we should be looking for odd primes
it is the cursed prime
we exclude 2 and 5 as they are factors of 10
lol they are cursed primes only in base 10.. any combination of 2 and 5 in the denominator gives a terminating decimal expansion : 1/(2^a5^b) always terminates
I found primes 13 and 7 and they both seem to have period 6 so it doesn't look lit it is one-to-one
look like*
Join our real-time social learning platform and learn together with your friends!