Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
Not the answer you are looking for? Search for more explanations.
sorry I can't help you I just start geometry
It's ok, just hope someone will be able to figure it out.
yes don't worry be patient ok body
As far as I know, @DebbieG is on the right track. "Greatest common divisor" is the same as "greatest common factor."
I think Debbie just got it.
Reposting this here for inquiring minds that want to know... lol....
OK, wait... I was looking up some number theory/ GCD stuff. I found this:
(a, b) = (a+kb, b) for any integer k
HAH! So tell me if this works.....
\(\Large (2^p\cdot 2^6-1,2^p\cdot 2^6+1)\)
Now let k=-1, so we subtract the first one from the second one:
\(\Large 2^p\cdot 2^6+1-(2^p\cdot 2^6-1)=2\)
So now we have:
\(\Large (2^p\cdot 2^6-1,2)\) Which..... pretty unquestionably.... is 1. Methinks?
Bottom of pg 1 - top of pg 2.