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

Home > Numbers
Theorem's proof (Posted on 2024-03-23) Difficulty: 3 of 5
For each positive integer n, S(n) is defined to be the greatest integer such that, for every positive integer k ≤ S(n), n^2 can be written as the sum of k positive square integers.
(a) Prove that S(n) ≤ n^2 − 14 for each n ≥ 4.
(b) Find an integer n such that S(n) = n^2 − 14.
(c) Prove that there are infinitely many integers n such that S(n) = n^2 − 14.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
There are no comments yet.
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
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