If n is prime, φ(n) equals

Unlock all questions

This demo includes only 20 questions. Upgrade to access hundreds of questions, flashcards, exam simulations, and disable ads.

Full question bankExam simulationsFlashcards
From $24.99Unlock all

Prepare for the GATE General Aptitude and CS Test. Enhance your skills with multiple choice questions and detailed explanations. Elevate your readiness and boost your confidence for the exam!

Multiple Choice

If n is prime, φ(n) equals

Explanation:
φ(n) counts how many integers from 1 to n are relatively prime to n. If n is prime, every number from 1 to n−1 shares no common factor with n, so gcd(k, n) = 1 for all k in that range. The only number up to n that isn’t coprime with n is n itself, since gcd(n, n) = n. Therefore there are n−1 integers less than n that are coprime to n, so φ(n) = n−1. This is why the correct value is n−1.

φ(n) counts how many integers from 1 to n are relatively prime to n. If n is prime, every number from 1 to n−1 shares no common factor with n, so gcd(k, n) = 1 for all k in that range. The only number up to n that isn’t coprime with n is n itself, since gcd(n, n) = n. Therefore there are n−1 integers less than n that are coprime to n, so φ(n) = n−1. This is why the correct value is n−1.

More Multiple Choice Questions
Subscribe

Get the latest from Examzify

You can unsubscribe at any time. Read our privacy policy