Question

Need help with a discrete math problem.

Answer 1

Here is the problem.

Answer 2

And here is what I have so far.

Answer 3

Except in the post above, I think we want the GCD not the GCF.

Answer 4

sorry I can't help you I just start geometry

Answer 5

It's ok, just hope someone will be able to figure it out.

Answer 6

yes don't worry be patient ok body

Answer 7

@SithsAndGiggles

Answer 8

As far as I know, @DebbieG is on the right track. "Greatest common divisor" is the same as "greatest common factor."

Answer 9

I think Debbie just got it.

Answer 10

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?


http://www.millersville.edu/~bikenaga/number-theory/gcd/gcd.pdf
Bottom of pg 1 - top of pg 2.