mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 25
Search took 0.01 seconds.
Search: Posts Made By: maheshexp
Forum: Miscellaneous Math 2004-08-28, 17:26
Replies: 29
Views: 2,021
Posted By maheshexp
hi , here got framed the formuale... ...

hi ,

here got framed the formuale...

r[i] = ( r[i-1] * n[i] ) mod m, where r[0] = 1, n = { set of numbers to be multiplied }, m value to be taken for finding reminder

the proof can...
Forum: Miscellaneous Math 2004-08-24, 16:28
Replies: 29
Views: 2,021
Posted By maheshexp
oh i c, all the example i see follow the way that...

oh i c, all the example i see follow the way that they either take full multiplication or take modulo of each term, multiply and finally take another modulo...that's why i thought of thinking in...
Forum: Miscellaneous Math 2004-08-24, 14:29
Replies: 29
Views: 2,021
Posted By maheshexp
oh , i am really apologize for my bad english. as...

oh , i am really apologize for my bad english. as u said i am not native english speaker. i am from india.

let me clearly explain my logic again.

if we have some "n" numbers which are quiet...
Forum: Miscellaneous Math 2004-08-24, 02:19
Replies: 29
Views: 2,021
Posted By maheshexp
did u consider my next post , i had said. for...

did u consider my next post , i had said. for smaller number it seems to be ok, but larger numbers, as i quoted an example in my next post....what's ur view upon that.

thanks for ur comments.
Forum: Miscellaneous Math 2004-08-23, 16:46
Replies: 29
Views: 2,021
Posted By maheshexp
one can think this situation also. ( 123 *...

one can think this situation also.

( 123 * 456 * 789 ) % 12345, where in this case taking modulo of each number is not results the same number and u have only choice that u need to multiply values...
Forum: Miscellaneous Math 2004-08-23, 16:42
Replies: 29
Views: 2,021
Posted By maheshexp
hi every one, i am back again with some more...

hi every one, i am back again with some more clarification. the algo posted works faster

in this case...

(123 *456 * 789 ) % 19, the conventional rule is that we can take up modulo for each no...
Forum: Math 2004-05-29, 01:54
Replies: 2
Views: 1,041
Posted By maheshexp
thanks friend...what u say is right... does...

thanks friend...what u say is right...

does any thing could be done faster using the binary techniques
Forum: Math 2004-05-28, 16:26
Replies: 2
Views: 1,041
Posted By maheshexp
Lightbulb Fast way to square???

can any one help me to find out wheather it multiples faster to get the "square of a number i.e x^2 "or not. if you have better solution , could u please give me.

y(1) = 1;
y(n) = y(n-1) + ( 1 +...
Forum: Lone Mersenne Hunters 2004-05-09, 14:40
Replies: 23
Views: 4,829
Posted By maheshexp
i can't understand what this meant ...

i can't understand what this meant

34.0-34.2M 62 63 or 64 bit (next in Primenet)
Forum: Lone Mersenne Hunters 2004-05-09, 03:57
Replies: 23
Views: 4,829
Posted By maheshexp
may i know what is this, so that i can also take...

may i know what is this, so that i can also take part, as i am new sorry for such type of questions
Forum: Miscellaneous Math 2004-05-09, 01:58
Replies: 29
Views: 2,021
Posted By maheshexp
i had found such a word from...

i had found such a word from http://www.utm.edu/research/primes/notes/proofs/LucasLehmer.html
>> Let p be an odd prime

what is odd prime...
Forum: Miscellaneous Math 2004-05-09, 01:55
Replies: 29
Views: 2,021
Posted By maheshexp
i had posted those comments explained in that...

i had posted those comments explained in that link. i can't get what it means
Forum: Miscellaneous Math 2004-05-08, 19:47
Replies: 29
Views: 2,021
Posted By maheshexp
Hey i found that my algorithm also works well for...

Hey i found that my algorithm also works well for the factors like

(a * b * c * d * e ...) % z
eg:
(2 * 3 * 4 * 5 ) % 7 = 1
do any one find any thing wrong in it
Forum: Miscellaneous Math 2004-05-08, 19:44
Replies: 29
Views: 2,021
Posted By maheshexp
can u explain me what this means One very...

can u explain me what this means

One very nice property of Mersenne numbers is that any factor q of 2P-1 must be of the form 2kp+1. Furthermore, q must be 1 or 7 mod 8. A proof is available....
Forum: Miscellaneous Math 2004-05-08, 18:52
Replies: 29
Views: 2,021
Posted By maheshexp
i had seen that when 2^p -1 is not divided by...

i had seen that when 2^p -1 is not divided by q=2kp+1, it is a Mersenne Priime, what are can the values for k or up to what range we should take k
Forum: Miscellaneous Math 2004-05-08, 18:43
Replies: 29
Views: 2,021
Posted By maheshexp
the binary algorithm is really faster

the binary algorithm is really faster
Forum: Miscellaneous Math 2004-05-08, 14:33
Replies: 29
Views: 2,021
Posted By maheshexp
finally my system got done Calculating 10 ^...

finally my system got done

Calculating 10 ^ 934534 % 456456...
-----------------------------
Calculating using My Algorithm...
Time Taken :78 ms
Result:418408
-----------------------------...
Forum: Miscellaneous Math 2004-05-08, 14:28
Replies: 29
Views: 2,021
Posted By maheshexp
ColdFury, lets have an ex: 10^20 ...

ColdFury,
lets have an ex: 10^20

1: 10 mod 7 = 3
2: 10 mod 7 = 3
3 * 3 = 9 mod 7 = 2 == 100 mod 7
3: 10 mod 7 = 3
2 * 3 = 6 mod 7 = 6 == 1000...
Forum: Miscellaneous Math 2004-05-08, 14:12
Replies: 29
Views: 2,021
Posted By maheshexp
sorry it's not 20 bit random, its 16 bit...

sorry it's not 20 bit random, its 16 bit random...since 20 bit random takes more time by system, and i need to waitfor it, but my algorithm takes

Time Taken :63 ms
Result:670543
Forum: Miscellaneous Math 2004-05-08, 14:10
Replies: 29
Views: 2,021
Posted By maheshexp
ColdFury, what u say is right, i am trying...

ColdFury,
what u say is right, i am trying to reduce it, but it's very simple rather than multiplying a huge number once , store in a datatype (if it supports ), and dividing it with a number is...
Forum: Miscellaneous Math 2004-05-08, 14:00
Replies: 29
Views: 2,021
Posted By maheshexp
Cyclamen Persicum may i know what is...

Cyclamen Persicum

may i know what is consequental mults a single way of powering ???. since i am new to these type of jargons, and i will try to learn it
Forum: Miscellaneous Math 2004-05-08, 13:55
Replies: 29
Views: 2,021
Posted By maheshexp
Lightbulb what is simple binary exponentiation algorithm,...

what is simple binary exponentiation algorithm, can u explain me that. since i am new to lot of algos...
Forum: Software 2004-05-08, 02:53
Replies: 2
Views: 603
Posted By maheshexp
note r1 is the result of the function

note r1 is the result of the function
Forum: Miscellaneous Math 2004-05-08, 02:52
Replies: 29
Views: 2,021
Posted By maheshexp
Lightbulb New way to Find (X^Y) % M

here i had developed a simple algorithm to calculate (X^Y)%M. i works well and faster than any string manipulated operations.

//(x^y)%m
long r1 = x % m;
// loop...
Forum: Software 2004-05-08, 02:50
Replies: 2
Views: 603
Posted By maheshexp
Lightbulb New way to Find (X^Y) % M

here i had developed a simple algorithm to calculate (X^Y)%M. i works well and faster than any string manipulated operations.

//(x^y)%m
long r1 = x % m;
// loop...
Showing results 1 to 25 of 25

 
All times are UTC. The time now is 08:25.

Sun Jul 5 08:25:04 UTC 2020 up 102 days, 5:58, 1 user, load averages: 1.49, 1.26, 1.19

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.