mersenneforum.org Search Results
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 25 of 30 Search took 0.01 seconds. Search: Posts Made By: baih
 Forum: Miscellaneous Math 2020-09-18, 01:51 Replies: 9 Views: 365 Posted By baih I DONT try to facto 2^1277-1 BY 2^1277-2 ... I DONT try to facto 2^1277-1 BY 2^1277-2 because i know the possibilty to find a large gcf(a-1,b-1) is very very small (excluded) approximately the gcf < 10 digts it wont do anything if the factor...
 Forum: Miscellaneous Math 2020-09-17, 23:06 Replies: 9 Views: 365 Posted By baih no becaus 8 very smal i said earlier it... no becaus 8 very smal i said earlier it needs to be very large to help
 Forum: Miscellaneous Math 2020-09-17, 22:30 Replies: 9 Views: 365 Posted By baih greatest common factor its clear that for a... greatest common factor its clear that for a composite numbre n = ab n-1 divide gcf(a-1,b-1) if gcf are a big numbre we can use it for...
 Forum: Miscellaneous Math 2020-09-13, 18:42 Replies: 9 Views: 365 Posted By baih JUST arror because 2304167 MOD 232 not equal to... JUST arror because 2304167 MOD 232 not equal to n1 SO sory 29 is false 2n-1= a*b this condition is IF (a-1) divided by (b-1)
 Forum: Miscellaneous Math 2020-09-13, 18:03 Replies: 9 Views: 365 Posted By baih factoring 2ⁿ-2 equivalent to factoring 2ⁿ-1(I think) 2n1= a*b factoring 2n-2 equivalent to factoring 2n-1 if this condition is met (a-1) divided by (b-1) then 2n-1 =1 mod b-1 example M11 = 0 mod 23 and ...
 Forum: Miscellaneous Math 2020-09-09, 00:55 Replies: 26 Views: 1,273 Posted By baih Originally Posted by retina View Post Every odd... Originally Posted by retina View Post Every odd number is half of an even number. Some even numbers are not double an odd number. Therefore there are more even numbers than odd numbers. ...
 Forum: Miscellaneous Math 2020-09-05, 01:34 Replies: 3 Views: 323 Posted By baih a very deep response i think you tell me (... a very deep response i think you tell me ( indirectly ) already excited. So i search a simple algorithm error detection for ab=c mod n
 Forum: Miscellaneous Math 2020-09-05, 00:16 Replies: 3 Views: 323 Posted By baih I ask this question because i'm working on a... I ask this question because i'm working on a script that can do this ( I have good progress) but What is it like to invent something, but later find out that it already exists?
 Forum: Miscellaneous Math 2020-09-04, 17:17 Replies: 3 Views: 323 Posted By baih Check modular Answers Given large numbre like merssene M82589933 and also a,b,c large numbres ab=c mod M82589933 counting the result frequently takes second ,minutes, months or years, dependent on the size of...
 Forum: Miscellaneous Math 2020-09-01, 02:39 Replies: 2 Views: 269 Posted By baih a nice remark about mersene composite a nice remark Mersenne Number 2n-1 x2 = (2n-2)-1 mod 2n-1 there is no solution for x if 2n-1 composite
 Forum: Miscellaneous Math 2020-08-31, 15:21 Replies: 0 Views: 181 Posted By baih odd or even Let a= 3 and n large numbre like RSA-260 ...
 Forum: Miscellaneous Math 2020-08-24, 01:04 Replies: 10 Views: 710 Posted By baih LET a3= b mod n x3= b mod n y3= b mod n ... LET a3= b mod n x3= b mod n y3= b mod n n-a = x+y we have x+y and we want x-y to find x the key is (x+y)2 mod n = xy mod n if a3= b mod n
 Forum: Information & Answers 2020-08-23, 00:53 Replies: 4 Views: 398 Posted By baih thank you so much I will publish my article... thank you so much I will publish my article on (the forum) In the coming days i hope the method ( brings added value)
 Forum: Information & Answers 2020-08-23, 00:33 Replies: 4 Views: 398 Posted By baih "my apologies" "my apologies"
 Forum: Information & Answers 2020-08-22, 23:09 Replies: 4 Views: 398 Posted By baih Publishing an altnative method to the Extended Euclidean Algorithm? hello I have a new alternative method to (The Extended Euclidean Algorithm for finding the inverse of a number mod n) A simple and easy method my question Is it good to publish it in the...
 Forum: Miscellaneous Math 2020-08-22, 19:31 Replies: 10 Views: 710 Posted By baih this code in (python) def r(a,n,u): ... this code in (python) def r(a,n,u): c2=(n*u)-a j= (c2//2) j22=pow(int(j),2,n) t=pow(c2,2,n)
 Forum: Miscellaneous Math 2020-08-22, 18:53 Replies: 10 Views: 710 Posted By baih THANKS i use pari gp and i compare ... THANKS i use pari gp and i compare factor(x^3-Mod(8,((n))) vs my method (have speed at all) but my method work only if n mod 4 = 3 because i use y(n+1)/4mod n to find the cubic roots
 Forum: Miscellaneous Math 2020-08-22, 16:25 Replies: 10 Views: 710 Posted By baih x³=8 MOD n LET n prime numbre and n = 1 mod 3 ...
 Forum: Miscellaneous Math 2020-08-21, 01:09 Replies: 7 Views: 550 Posted By baih non The difficulty is the same as the... non The difficulty is the same as the difficulty of (Trial division) But it may help in some cases If someone found a solution to the equation c=nxy+x+y
 Forum: Miscellaneous Math 2020-08-20, 22:27 Replies: 7 Views: 550 Posted By baih thanks i mean (2^n)-2 thanks i mean (2^n)-2
 Forum: Miscellaneous Math 2020-08-20, 20:47 Replies: 7 Views: 550 Posted By baih Mersenne factorization by (nxy+x+y) Let Mersenne number 2n -1 if 2n -1 composite 2n -1 = n2xy + (x+y)n + 1 so 2n /n
 Forum: Factoring 2019-10-09, 19:46 Replies: 1 Views: 354 Posted By baih Condition on composite numbers easily factored (Challenger) q prime numbre p prime numbre and q>p lets c = qp e= 2^p mod q if we know e we can factore (c)
 Forum: Factoring 2019-09-29, 15:05 Replies: 16 Views: 770 Posted By baih my solution are :qp =c lets n is integer ... my solution are :qp =c lets n is integer e= (c+1)/4 s= n^e Mod c q= gcd(s-n,c)
 Forum: Factoring 2019-09-28, 22:46 Replies: 16 Views: 770 Posted By baih yes i know but step by step:wink: yes i know but step by step:wink:
 Forum: Factoring 2019-09-28, 20:02 Replies: 16 Views: 770 Posted By baih purpose a large number c more than 1024BIT ... purpose a large number c more than 1024BIT with p and q also very large p and q (private key) c is public i can find pq from c
 Showing results 1 to 25 of 30

All times are UTC. The time now is 07:20.

Tue Sep 22 07:20:48 UTC 2020 up 12 days, 4:31, 0 users, load averages: 1.36, 1.34, 1.41