Let a,n be positive integers with gcd(a,n)=1. Show that if has a solution, then , where d = gcd ( ).

Note: denotes the number of positive integers less than a that are relative prime to a.

Results 1 to 3 of 3

- Apr 8th 2008, 06:34 AM #1

- Joined
- Mar 2006
- Posts
- 705
- Thanks
- 2

- Apr 8th 2008, 07:29 AM #2

- Joined
- Nov 2005
- From
- New York City
- Posts
- 10,616
- Thanks
- 10

- Apr 8th 2008, 10:36 AM #3

- Joined
- Mar 2006
- Posts
- 705
- Thanks
- 2