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

Home > General
Prime clock (Posted on 2004-08-01) Difficulty: 3 of 5
Given a clock, rearrange six consecutive numbers on its face, so the sum of every pair of adjacent numbers is a prime.

See The Solution Submitted by Federico Kereki    
Rating: 3.7500 (8 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution No Subject | Comment 11 of 17 |
20,21,22,25,24,23 is one solution to the problem
Generally this permutaion a,a+1,a+2, a+5, a+ 4, a+3 will work whenever you have a prime quadruple
30n+11, 30n+13, 30n+17, 30n + 19 and we let a = 30n+10
  Posted by neshal on 2004-08-02 05:25:23
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information