thinking about this question ,if anyone have idea http://openstudy.com/study#/updates/53ee042fe4b0f30a87d63d4d
@Kainui also this we need to think about
we need to find some common composite property for these only 34343 34343434343 34343434343434343 34343434343434343434343 34343434343434343434343434343
lets not consider other two cases which are already proven
well if any one find anything i'll be online soon just type it
if u mean that what is the pattern of that equation consider that: \( \large \Large a _{n} = 10^{6} a _{n-1} + 434343\) and of \(\large a _{n} = pa _{n-1} + q\) and \( \large a_{1} = r \) then, \[\large a _{n} = rp ^{n-1} + q.\frac{ p^{n-1} -1}{ p-1 }\] (i can prove it... if u want,i'll prove it in a new question)
so here,in this sequence we have: \[\Large a _{n} = 34343(10^{6n-6}) + 434343(\frac{ 10^{6n-6}-1 }{ 10^{6}-1 })\]
u meant this?
na i know the pattern i want to prove why its composite each time
wel,then got it :)
k , how ? :D
i'm trying to use that pattern and show that all of them are composite.
ok have fun :P but note that we have prove 2 part in the sequence this pattern is not proven yet 34343 34343434343 34343434343434343 34343434343434343434343 34343434343434343434343434343
ok let me read those proofs carefully,maybe i get some idea...
when number of digits lets say n and n mod 3=2
not getting idea... i'll be back for about 2 hours.have u got any idea?
no i have reached up to 400 digit :D no prime
just change interval >.< http://www.wolframalpha.com/input/?i=table+of+primeQ%2834343*%2810%5E%286n%E2%88%926%29%29%2B434343*%28%2810%5E%286n%E2%88%926%29%E2%88%921%29%2F%2810%5E6%E2%88%921%29%29%29+for+n+%3D+350+to+380
:D don't do that any more,now we are confident that there's no prime.let just prove it...i'm trying to write the numbers in a way which can prove that all of them are composite...
Join our real-time social learning platform and learn together with your friends!