Math,Gcd - Codeforces

→ Pay attention

*has extra registration

→ Top rated

→ Top contributors

View all →

→ Find user

→ Recent actions

Detailed →

Math,Gcd

Revision en2, by sahasumit288, 2016-10-15 22:26:07

n is a number and n=(p1^a) * (p2^b).Here p1 and p2 are prime.

$\text{[math]}$ gcd(i,n)= $\text{[math]}$ gcd(i,p1^a) * $\text{[math]}$ gcd(i,p2^b) How can I prove this?

Revisions

Rev.	By	When	Δ	Comment
en5	sahasumit288	2016-10-15 22:33:31	3	Tiny change: 'b)\n\nHow can to prove ' -> 'b)\n\nHow to prove '
en4	sahasumit288	2016-10-15 22:29:28	2	Tiny change: 'gcd(i,b)\nHow can ' -> 'gcd(i,b)\n\nHow can '
en3	sahasumit288	2016-10-15 22:28:23	79
en2	sahasumit288	2016-10-15 22:26:07	3
en1	sahasumit288	2016-10-15 22:25:19	216	Initial revision (published)