Search found 5 matches

by neo_tohin
Sun Feb 29, 2004 9:24 am
Forum: Volume 5 (500-599)
Topic: 583 - Prime Factors
Replies: 171
Views: 36714

Easy way

I think your code is very big one. And you are generated all primes.
Check the way that i generate the prime factor of 24

24 / 2 = 12
12 / 2 = 6
6 / 2 = 3
3 / 3 = 1
so the prime factors are 24 = 2 * 2 * 2 * 3.

Ha Ha easy way isn't it. :lol:
by neo_tohin
Sat Feb 07, 2004 2:35 pm
Forum: Volume 3 (300-399)
Topic: 374 - Big Mod
Replies: 79
Views: 11582

little brother come to help

As further i know 0^0 is undefined. But i think you should try to use the modulus as 0. try it . the explanation is: 0^0 is undefined cause we could not decide(0/0 means 0^1-1) on the ? area. 0 | 0 | ? 0 ------------ 0 I think same thing happens to others cases of undefined and infinite. So, i reque...
by neo_tohin
Wed Jan 07, 2004 12:24 pm
Forum: Volume 3 (300-399)
Topic: 374 - Big Mod
Replies: 79
Views: 11582

I don't understand your code

Sorry brother me also getting tl. :cry:
but my algorithm is not so big as yours.

check this out man:

(m*m*m)mod p=(m mod p * m mod p)mod p

ha ha ha :lol:
by neo_tohin
Wed Jan 07, 2004 10:03 am
Forum: Algorithms
Topic: Need help on prime numbers
Replies: 7
Views: 2651

Nice day isn't it to check prime?

hi there i am a new poster . i think you can see it in left side :P

i have change the sieve a little.
it generates 1 - 200000000 primes in just 7 seconds.

wanna know ? :-?

sent mail to me / :wink:

i will sent the algroithm :wink: .

sorry not the code :evil:
by neo_tohin
Wed Jan 07, 2004 6:38 am
Forum: Volume 101 (10100-10199)
Topic: 10127 - Ones
Replies: 32
Views: 12434

Ha ha ha ha ha ha ha?????????????????????

Jalal bhai apna to er ekta stupid 8)

Bhagsash upopado bhola gaachan :lol:

Moni, use this method

3 | 111 | 37
9
-----------------
21
21
--------------------
0


lala la la la :D

Go to advanced search