A Square pyramidal number represents sum of squares of first natural numbers. First few Square pyramidal numbers are 1, 5, 14, 30, 55, 91, 140, 204, 285, 385, 506, …
Geometrically these numbers represent number of spheres to be stacked to form a pyramid with square base. Please see this Wiki image for more clarity.
Given a number s (1 <= s <= 1000000000). If s is sum of the squares of the first n natural numbers then print n, otherwise print -1.
Input : 14 Output : 3 Explanation : 1*1 + 2*2 + 3*3 = 14 Input : 26 Output : -1
A simple solution is to run through all numbers starting from 1, compute current sum. If current sum is equal to given sum, then we return true, else false.
We can write solutions as
k * (k + 1) * (2*k + 1) / 6 = s
k * (k + 1) * (2*k + 1) – 6s = 0
We can find roots of above cubic equation using Newton Raphson Method, then check if root is integer or not.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Pentagonal Pyramidal Number
- Difference between sum of the squares of first n natural numbers and square of sum
- Find the number of squares inside the given square grid
- Smallest N digit number whose sum of square of digits is a Perfect Square
- Find smallest perfect square number A such that N + A is also a perfect square number
- Find the side of the squares which are lined in a row, and distance between the centers of first and last square is given
- Puzzle | Dividing a Square into N smaller squares
- Count squares of size K inscribed in a square of size N
- Check if a number is a perfect square having all its digits as a perfect square
- Check if a number is perfect square without finding square root
- Minimum number of squares whose sum equals to given number N | set 2
- Minimum number of squares whose sum equals to a given number N | Set-3
- Minimum number of squares whose sum equals to given number n
- Minimize the sum of the squares of the sum of elements of each group the array is divided into
- Find K numbers with sum equal to N and sum of their squares maximized
- Count square and non-square numbers before n
- Check whether a number can be represented by sum of two squares
- Number of ways of writing N as a sum of 4 squares
- Sum of the count of number of adjacent squares in an M X N grid
- Count all subarrays whose sum can be split as difference of squares of two Integers
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.