JOIN
 Select a Forum     Round Tables New Member Discussions News Discussions Algorithm Matches Marathon Matches NASA Tournament Lab TopCoder Cookbook High School Matches Sponsor Discussions Development Forums Design Forums Search | Watch Thread  |  My Post History  |  My Watches  |  User Settings View: Flat (oldest first)  | Threaded  | Tree Previous Thread  |  Next Thread Forums Tutorial Discussions Prime Numbers, Factorization and Euler Function (Article) Typo
 Re: Typo (response to post by ilham) | Reply Finally I understood that"...number n can contain no more than one factor, greater than [square root of] n..."[square root of] missing obfuscated me a bit...
 Typo | Reply "Exercise 2. Ferma numbers..."Fermat?"φ(n) ={a ? N: 1 ≤ a ≤ n, gcd(a, n) = 1}"What is this I with hat (apparently the forum parser cannot recognize the character i copy pasted directly from the article)? I've tried using several encodings (unicode, western, cyrillic). Is it \in or ∈ or ∈ ?"a φ (n) ? 1 (mod n)."This degree symbol (again, cannot be recognized by the forum parser) is ≡?"Any divisor of number n can be represented as a product x1 * x2 * … * x k , where xi � Ai."Again, is it \in or ∈ or ∈ ?
 Forums Tutorial Discussions Prime Numbers, Factorization and Euler Function (Article) Typo Previous Thread  |  Next Thread