BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem
TTP OnDemand GMAT Video Course
Featured Course

Target Test Prep GMAT OnDemand

Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.

  • 715+ score guarantee — highest in the industry (99th percentile)
  • 52 chapters · 1,500+ lessons · 4,000+ practice questions
  • 400 hours of video · 1,500+ instructor-led HD smartboard lessons
  • 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
  • 24/7 live support + weekly Zoom office hours with GMAT instructors
  • TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
  • 1,200+ flashcards + AI-powered study assistant & daily calendar
  • OnDemand, LiveTeach & GMAT Bootcamp formats available
  • Also: GRE, SAT Math & Executive Assessment courses
  • MBA Admissions Consulting now available
  • 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
  • 200,000+ students served
  • 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★ 5.0 (559 reviews)
130-pt guarantee
$0 to start then $127/mo
Start Free 5-Day Trial Read 559 Reviews →

easy problem, but still...

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
Junior | Next Rank: 30 Posts
Posts: 12
Joined: Wed Dec 16, 2009 1:41 pm
by nailyad » Sun Dec 20, 2009 1:43 pm
The function f is defined for all positive integers by the rule:f(n) is the number of positive integers each of which is less than n and has no positive factor in common with n other than 1. If p is any prime number then f(P)=

The answer is p-1.

What is the best way to approach to this problem?
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
Master | Next Rank: 500 Posts
Posts: 202
Joined: Tue Sep 08, 2009 11:34 pm
Thanked: 15 times
GMAT Score:760

by cbenk121 » Sun Dec 20, 2009 9:31 pm
nailyad wrote:The function f is defined for all positive integers by the rule:f(n) is the number of positive integers each of which is less than n and has no positive factor in common with n other than 1. If p is any prime number then f(P)=

The answer is p-1.

What is the best way to approach to this problem?
Prime number, by definition, only has itself and 1 as a factor. Therefore, if f(n) is the # of pos integers less than n, then it would be equal to p-1. It won't be p-2, because "1" is allowable (...has no positive factor in common with n other than 1).
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1