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

Home > Numbers
A square pairing (Posted on 2017-11-29) Difficulty: 3 of 5
Let us pair the squares of the numbers 1 to n with the squares of the numbers n+1 to 2n such that each pair sums up to a prime.

1. Demonstrate that it is not possible for n1=3, n2=?(find out) and n3=??(find out)
2. For what value of n there are exactly 2 ways to perform the task?

Hint: all answers are below 15

See The Solution Submitted by Ady TZIDON    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Solutioncomputer solutionCharlie2017-11-29 13:31:55
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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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