On Mar 9, 1:54 pm, casevh wrote:
> After a few hours, the remaining factors are
>
> 6060517860310398033985611921721
>
> and
>
> 9941808367425935774306988776021629111399536914790551022447994642391
>
> casevh
Whoops---I missed this. I'm too slow! But at least my answers agree
with yours. (Factor
On Mar 9, 6:39 am, casevh wrote:
> [also replying to Geremy since the OP's message doesn't appear...]
>
> On Mar 8, 11:05 am, geremy condra wrote:
>
>
>
>
>
> > On Mon, Mar 8, 2010 at 2:15 AM, Fahad Ahmad wrote:
> > > Thanks Geremy,
>
> > > That has been an absolute bump... GOD i cant si
On Mar 8, 10:39 pm, casevh wrote:
> [also replying to Geremy since the OP's message doesn't appear...]
>
> On Mar 8, 11:05 am, geremy condra wrote:
>
>
>
>
>
> > On Mon, Mar 8, 2010 at 2:15 AM, Fahad Ahmad wrote:
> > > Thanks Geremy,
>
> > > That has been an absolute bump... GOD i cant s
[also replying to Geremy since the OP's message doesn't appear...]
On Mar 8, 11:05 am, geremy condra wrote:
> On Mon, Mar 8, 2010 at 2:15 AM, Fahad Ahmad wrote:
> > Thanks Geremy,
>
> > That has been an absolute bump... GOD i cant sit on my chair, it has
> > worked even on 512 bit number
[Replying to Geremy's reply because the OP's post didn't show up in my
newsreader.]
On Mar 7, 8:40 pm, geremy condra wrote:
> On Sun, Mar 7, 2010 at 1:55 PM, Fahad Ahmad wrote:
> > Dear All,
>
> > i am writing my crytographic scheme in python, i am just a new user to it.
> > I have written the co
On Mon, Mar 8, 2010 at 2:05 PM, geremy condra wrote:
> On Mon, Mar 8, 2010 at 2:15 AM, Fahad Ahmad wrote:
>> Thanks Geremy,
>>
>> That has been an absolute bump... GOD i cant sit on my chair, it has
>> worked even on 512 bit number and with no time..
>> superb i would say.
>>
>> l
On Mon, Mar 8, 2010 at 2:15 AM, Fahad Ahmad wrote:
> Thanks Geremy,
>
> That has been an absolute bump... GOD i cant sit on my chair, it has
> worked even on 512 bit number and with no time..
> superb i would say.
>
> lastly, i am using the code below to calculate Largest Prime fac
26109913291424366305511581086089650628117463925776754560048454991130443047)
> makes python go crazy. Is there any way just like above, i can have it
> calculated it in no time.
>
>
> thanks for the support.
>
>
>
>
> > Date: Sun, 7 Mar 2010 15:40:59 -0500
> > Sub
start
the code works with a bit of delay on the number : "1238162376372637826" but
extending it to
(109026109913291424366305511581086089650628117463925776754560048454991130443047109026109913291424366305511581086089650628117463925776754560048454991130443047)
makes python go crazy. Is there any way just like above, i can have it
calculated it in no time.
thanks for the support.
> Date: Sun, 7 Mar 2010 1
On Sun, Mar 7, 2010 at 1:55 PM, Fahad Ahmad wrote:
> Dear All,
>
> i am writing my crytographic scheme in python, i am just a new user to it.
> I have written the complete code, the only point i am stuck it is that i am
> using 256 exponentiation which is normal in crytography but python just
> ha
10 matches
Mail list logo