Hey there! Sign in to join this conversationNew here? Join for free

Series problem Watch

Announcements
    • Thread Starter
    Offline

    11
    ReputationRep:
    Of 1, 2, 3,... 6000 how many are not multiples of 2, 3 or 5?
    I'm coming up with 1600 but since there's no answer available I want to see what you guys get and how you get it.
    • Study Helper
    Offline

    13
    (Original post by Student1256)
    Of 1, 2, 3,... 6000 how many are not multiples of 2, 3 or 5?
    I'm coming up with 1600 but since there's no answer available I want to see what you guys get and how you get it.
    Agreed:

    \displaystyle\frac{8}{30}\times 6000= 1600
    • Thread Starter
    Offline

    11
    ReputationRep:
    (Original post by ghostwalker)
    Agreed:

    \displaystyle\frac{8}{30}\times 6000= 1600
    wondering why it doesnt work if you do (2/10)*6000. what would define when the cycle is at a complete? because the cycle hasnt completed at 10 so it gives a faulty answer
    • Thread Starter
    Offline

    11
    ReputationRep:
    Bump
    Offline

    17
    ReputationRep:
    (Original post by Student1256)
    wondering why it doesnt work if you do (2/10)*6000. what would define when the cycle is at a complete? because the cycle hasnt completed at 10 so it gives a faulty answer
    30 works bc its the LCM so the cycle completes then.

    of course you could use cycles of 60,90,120 etc and it would also work fine
    • Official TSR Representative
    Offline

    11
    ReputationRep:
    (Original post by ghostwalker)
    Agreed:

    \displaystyle\frac{8}{30}\times 6000= 1600
    You can treat this as a Venn diagram problem in disguise (set A = 2, set B = 3, set C = 5).

    Start with 6,000/(2 x 3 x 5) which gives you 2 union 3 union 5 (or A union B union C) in the middle of the Venn and work outwards. Then add up the total of multiples and deduct this from 6,000. This gives you the set of integers from 1 to 6000 that are not members of the sets of A, B, or C.
    • Thread Starter
    Offline

    11
    ReputationRep:
    (Original post by BrasenoseAdm)
    You can treat this as a Venn diagram problem in disguise (set A = 2, set B = 3, set C = 5).

    Start with 6,000/(2 x 3 x 5) which gives you 2 union 3 union 5 (or A union B union C) in the middle of the Venn and work outwards. Then add up the total of multiples and deduct this from 6,000. This gives you the set of integers from 1 to 6000 that are not members of the sets of A, B, or C.
    Interesting approach! didn't expect an Oxford admissions representative on tsr to reply but it made my day haha

    Ironically this problem is from an at interview test from trinity college :laugh:
 
 
 
  • See more of what you like on The Student Room

    You can personalise what you see on TSR. Tell us a little about yourself to get started.

  • Poll
    Will you be richer or poorer than your parents?
    Useful resources

    Make your revision easier

    Maths

    Maths Forum posting guidelines

    Not sure where to post? Read the updated guidelines here

    Equations

    How to use LaTex

    Writing equations the easy way

    Student revising

    Study habits of A* students

    Top tips from students who have already aced their exams

    Study Planner

    Create your own Study Planner

    Never miss a deadline again

    Polling station sign

    Thinking about a maths degree?

    Chat with other maths applicants

    Can you help? Study help unanswered threads

    Groups associated with this forum:

    View associated groups
  • See more of what you like on The Student Room

    You can personalise what you see on TSR. Tell us a little about yourself to get started.

  • The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

    Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

    Quick reply
    Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.