All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Surf City Semiprimes (Posted on 2011-09-27) Difficulty: 2 of 5

Let n be some arbitrarily huge number; call each prime between 1 and n a 'GIRL'; call each even semiprime between 1 and n a 'BOY'.

Prove that there are two GIRLs for every BOY.

(An even semiprime is a composite number one of whose two prime factors is 2.)

See The Solution Submitted by broll    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Hints/TipsNo Subjectbroll2011-09-27 23:14:21
SolutionproofCharlie2011-09-27 16:55:12
I don't think it's true. Maybe I do.Jer2011-09-27 11:13:57
Some ThoughtsMenage a troisSteve Herman2011-09-27 10:38:32
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information