A Number Theory Problem about gcd
From: Gordon (gongz_at_00172.com)
Date: 10/09/05
- Previous message: Zeljko Vrba: "Re: X68-64 buffer overflow exploits and the borrowed code chunks exploitation technique"
- Next in thread: Alexey Kats: "Re: A Number Theory Problem about gcd"
- Reply: Alexey Kats: "Re: A Number Theory Problem about gcd"
- Reply: Mike Amling: "Re: A Number Theory Problem about gcd"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 9 Oct 2005 00:23:39 -0700
want somebody can give full prove process
The problem is :
if: Pr[gcd(a,b)=1]=p
prove: Pr[gcd(a,b)=d]=p/d^2
Thanks!
- Previous message: Zeljko Vrba: "Re: X68-64 buffer overflow exploits and the borrowed code chunks exploitation technique"
- Next in thread: Alexey Kats: "Re: A Number Theory Problem about gcd"
- Reply: Alexey Kats: "Re: A Number Theory Problem about gcd"
- Reply: Mike Amling: "Re: A Number Theory Problem about gcd"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]