mersenneforum.org  

Go Back   mersenneforum.org > New To GIMPS? Start Here! > Homework Help

Closed Thread
 
Thread Tools
Old 2017-09-17, 06:35   #1
crack11
 
Sep 2017

1816 Posts
Default math gcd problem need help

Dear all im new in this Greatest forum i have problem in mathematica i need calculate gcd from this string:
Code:
Z1:=(7580104959982914123117804044806461820154572036369549529405552162648856956231245030405896783337631871321017085933334306430501343909365379890910193903441-(7601611438277968963930435339966375537762723788929138241505092335032216337024111944145650540579951639515460945444623092013993572866002842083492323809287290^17592186175489));
Z2:= (7580104959982914123117804044806461820154572036369549301773204651044654156328611994019678602790933052049997074737942147009504600337458372628655015658163-(5472021051232020294637156058031796107019454396525172260491306567922450488302345750910648307191204110931670031994886144725045972546892458995859985546716414^17592186175489));
Z3:= (7580104959982914050609440727680305970398447676033232174897745114621599628756001756455762578505630805317234747401759098214730033873908508468766892578356-(2716401471494295676405217606243925186946305783849093640906079739928627393562677984831598246598185728284424287135181309232467496805930321500988187816347957^17592186175489));
ToUpperCase[IntegerString[(GCD[Z1,Z2,Z3]),16]]
but math show error i attachment this error img please help me to solve this issu...
Attached Thumbnails
Click image for larger version

Name:	Screenshot - 9_7_2017 , 9_28_35 PM.png
Views:	266
Size:	34.8 KB
ID:	16855  
crack11 is offline  
Old 2017-09-18, 06:50   #2
ewmayer
2ω=0
 
ewmayer's Avatar
 
Sep 2002
República de California

25·307 Posts
Default

Your problem is not 'in mathematica', your problem is that you are blindly attempting to get mathematica to do a computation without having thought through how large those exponentials you are inputting are. So tell us - and you don't need any fancy maths package for this, just some simple digit-counting and basic algebra - roughly how many decimal digits will your GCD inputs have once the exponentiations are done?
ewmayer is offline  
Old 2017-09-18, 11:00   #3
crack11
 
Sep 2017

23·3 Posts
Default

Dear sir,

without mathe matica how its possibel its 64bit gcd computation my laptop dell i7 with 8GB RAM...
crack11 is offline  
Old 2017-09-18, 11:34   #4
axn
 
axn's Avatar
 
Jun 2003

477610 Posts
Default

The problem is the size of the calculation. What you want to do is impossible
axn is online now  
Old 2017-09-18, 11:37   #5
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

7×277 Posts
Default

Those numbers are too large for the available memory. Why don't you try the GCD function without the exponents and then raise it to the power of the smallest exponent?

The GCD (8^a,6^b,18^c)= 2^( Smallest of a,b ,c)
You can do all that programmatically if you wish.
a1call is offline  
Old 2017-09-18, 11:38   #6
crack11
 
Sep 2017

23·3 Posts
Default

i need 512 rsakey from this string please help me..
crack11 is offline  
Old 2017-09-18, 14:22   #7
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

41·109 Posts
Default

Quote:
Originally Posted by crack11 View Post
i need 512 rsakey from this string please help me..
You've been given help. You haven't answered any of the questions posed in the replies, nor shown any indication you comprehend what you're trying to do.
VBCurtis is offline  
Old 2017-09-18, 14:24   #8
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

41·109 Posts
Default

Quote:
Originally Posted by a1call View Post
The GCD (8^a,6^b,18^c)= 2^( Smallest of a,b ,c)
Huh? If a = 1, b = 2, c = 2, I'm pretty sure the GCD is not 2^1.
VBCurtis is offline  
Old 2017-09-18, 15:22   #9
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

2×2,969 Posts
Default

Quote:
Originally Posted by VBCurtis View Post
Huh? If a = 1, b = 2, c = 2, I'm pretty sure the GCD is not 2^1.
Right, it should have been min(3a, b, c). But the point remains that the gcd needs to be computed symbolically rather than by blindly expanding then taking the gcd.
CRGreathouse is offline  
Old 2017-09-18, 15:48   #10
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

23·11·43 Posts
Default

Hmm. I'm not familiar with Mathematica syntax. The three integers all seem to be of the form

a - b^17592186175489.

The three values of a are

7580104959982914123117804044806461820154572036369549529405552162648856956231245030405896783337631871321017085933334306430501343909365379890910193903441

7580104959982914123117804044806461820154572036369549301773204651044654156328611994019678602790933052049997074737942147009504600337458372628655015658163

7580104959982914050609440727680305970398447676033232174897745114621599628756001756455762578505630805317234747401759098214730033873908508468766892578356

which have a suspiciously long block of MSD's in common.

Beyond that, I don't see anything particularly useful.
Dr Sardonicus is offline  
Old 2017-09-18, 16:26   #11
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

7×277 Posts
Default

Quote:
Originally Posted by VBCurtis View Post
Huh? If a = 1, b = 2, c = 2, I'm pretty sure the GCD is not 2^1.
Good point. I did not think of that.
Thank you.
a1call is offline  
Closed Thread

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
A new problem similar to the Collatz problem dabler Miscellaneous Math 1 2018-07-28 14:03
Math ET_ Operazione Doppi Mersennes 4 2012-09-20 19:33
Runescape math problem jasong Homework Help 10 2012-04-21 01:09
Help with Math Problem jinydu Puzzles 4 2003-12-13 06:00
Need help with math problem re: searching for all primes. daxm Miscellaneous Math 5 2003-07-20 19:32

All times are UTC. The time now is 02:34.

Wed Nov 25 02:34:47 UTC 2020 up 75 days, 23:45, 4 users, load averages: 1.32, 1.41, 1.40

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.