Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Find smallest perfect square number A such that N + A is also a perfect square number

  • Difficulty Level : Medium
  • Last Updated : 23 Mar, 2021

Given a positive number N. The task is to find out the smallest perfect square number A such that N + A is also a perfect square number or return -1.
Examples: 
 

Input: N = 3
Output: 1
Explanation: 
As 1 + 3 = 4 = 22

Input: N=1
Output: -1

 

Naive Approach: 
Traverse M from {1, 2, 3, 4, 5…} and check whether (N + M * M) is a perfect square number or not.
Efficient Approach: 
 

  • On observing, we have an equation like: 
     
  • N + (X * X) = (M * M) where N is given and M and X are unknown.
  • We can rearrange it and get: 
    • N = (M * M) – (X * X)
    • N = (M + X) * (M – X)
  •  
  • Now we can see that for obtaining N, we need to find the factor of N.The factor of N can be obtained in O(N) time. But it can be optimized to O(N^1/2) by this method. 
     
  • Let the factor of N be a and b = (N / a). So, from the above equation a = (M – X) and b = (M + X), and after solving this we can obtain the value of X = (b – a)/2. 
     

Below is the implementation of the above approach: 
 

C++




// C++ code to find out the smallest
// perfect square X which when added to N
// yields another perfect square number.
#include<bits/stdc++.h>
using namespace std;
 
long SmallestPerfectSquare(long N){
     
    // X is the smallest perfect
    // square number
    long X = (long)1e9;
    long ans;
     
    // Loop from 1 to square root of N
    for(int i = 1; i < sqrt(N); i++)
    {
     
        // Condition to check whether i
        // is factor of N or not
        if (N % i == 0)
        {
            long a = i;
            long b = N / i;
     
            // Condition to check whether
            // factors satisfies the
            // equation or not
            if((b - a != 0) && ((b - a) % 2 == 0))
            {
                         
                // Stores minimum value
                X = min(X, (b - a) / 2);
            }
        }
    }
     
    // Return if X * X if X is not equal
    // to 1e9 else return -1
    if (X != 1e9)
        ans = X * X;
    else
        ans = -1;
             
    return ans;
}
     
// Driver code
int main()
{
    long N = 3;
    cout << SmallestPerfectSquare(N);
    return 0;
}
 
// This code is contributed by AnkitRai01
Java



// Java code to find out the smallest
// perfect square X which when added to N
// yields another perfect square number.
 
public class GFG {
     
 
    static long SmallestPerfectSquare(long N)
    {
     
        // X is the smallest perfect
        // square number
        long X = (long)1e9;
        long ans;
     
        // Loop from 1 to square root of N
        for(int i = 1; i < Math.sqrt(N); i++){
     
            // Condition to check whether i
            // is factor of N or not
            if (N % i == 0){
                long a = i ;
                long b = N / i;
     
                // Condition to check whether
                // factors satisfies the
                // equation or not
                if ((b - a != 0) && ((b - a) % 2 == 0)){
                         
                    // Stores minimum value
                    X = Math.min(X, (b - a) / 2) ;
                }
            }
        }
     
        // Return if X * X if X is not equal
        // to 1e9 else return -1
        if (X != 1e9)
            ans = X * X;
        else
            ans = -1;
             
        return ans;
    }
     
    // Driver code
    public static void main (String[] args){
        long N = 3;
         
        System.out.println(SmallestPerfectSquare(N)) ;
     
        }
}
// This code is contributed by AnkitRai01
Python3



# Python3 code to find out the smallest
# perfect square X which when added to N
# yields another perfect square number.
import math
def SmallestPerfectSquare(N):
 
    # X is the smallest perfect
    # square number
    X = 1e9
 
    # Loop from 1 to square root of N
    for i in range(1, int(math.sqrt(N)) + 1):
 
        # Condition to check whether i
        # is factor of N or not
        if N % i == 0:
            a = i
            b = N // i 
 
            # Condition to check whether 
            # factors satisfies the
            # equation or not
            if b - a != 0 and (b - a) % 2 == 0:
                    
                # Stores minimum value
                 X = min(X, (b - a) // 2)
 
    # Return if X * X if X is not equal
    # to 1e9 else return -1
    return(X * X if X != 1e9 else -1)
 
# Driver code
if __name__ == "__main__" : 
   
    N = 3
   
    print(SmallestPerfectSquare(N))
C#



// C# code to find out the smallest
// perfect square X which when added to N
// yields another perfect square number.
using System;
 
class GFG {
     
    static long SmallestPerfectSquare(long N)
    {
        // X is the smallest perfect
        // square number
        long X = (long)1e9;
        long ans;
     
        // Loop from 1 to square root of N
        for(int i = 1; i < Math.Sqrt(N); i++){
     
            // Condition to check whether i
            // is factor of N or not
            if (N % i == 0)
            {
                long a = i;
                long b = N / i;
     
                // Condition to check whether
                // factors satisfies the
                // equation or not
                if ((b - a != 0) && ((b - a) % 2 == 0))
                {
                    // Stores minimum value
                    X = Math.Min(X, (b - a) / 2);
                }
            }
        }
     
        // Return if X*X if X is not equal
        // to 1e9 else return -1
        if (X != 1e9)
            ans = X * X;
        else
            ans = -1;
             
        return ans;
    }
     
    // Driver code
    public static void Main (string[] args)
    {
        long N = 3;
        Console.WriteLine(SmallestPerfectSquare(N));
    }
}
 
// This code is contributed by AnkitRai01
Javascript



<script>
 
// JavaScript code to find out the smallest
// perfect square X which when added to N
// yields another perfect square number. 
 
function SmallestPerfectSquare(N){
     
    // X is the smallest perfect
    // square number
    let X = 1e9;
    let ans;
     
    // Loop from 1 to square root of N
    for(let i = 1; i < Math.sqrt(N); i++)
    {
     
        // Condition to check whether i
        // is factor of N or not
        if (N % i == 0)
        {
            let a = i;
            let b = N / i;
     
            // Condition to check whether
            // factors satisfies the
            // equation or not
            if((b - a != 0) && ((b - a) % 2 == 0))
            {
                         
                // Stores minimum value
                X = Math.min(X, (b - a) / 2);
            }
        }
    }
     
    // Return if X * X if X is not equal
    // to 1e9 else return -1
    if (X != 1e9)
        ans = X * X;
    else
        ans = -1;
             
    return ans;
}
     
// Driver code
 
    let N = 3;
    document.write(SmallestPerfectSquare(N)); 
 
// This code is contributed by Surbhi Tyagi.
 
</script>
Output: 
1
 
Time complexity: sqrt(N)
 

My Personal Notes
arrow_drop_up
Next

Smallest N digit number whose sum of square of digits is a Perfect Square
Recommended Articles
Page :
Print all Perfect Numbers from an array whose sum of digits is also a Perfect Number
19, Feb 21
Check if a number is a perfect square having all its digits as a perfect square
15, Sep 20
Smallest N digit number whose sum of square of digits is a Perfect Square
22, Apr 20
Count of pair of integers (x , y) such that difference between square of x and y is a perfect square
27, Sep 21
Count numbers upto N which are both perfect square and perfect cube
17, Dec 18
Count of all values of N in [L, R] such that count of primes upto N is also prime
03, Jul 20
Check if a number is perfect square without finding square root
01, Jan 19
Find the minimum value of m that satisfies ax + by = m and all values after m also satisfy
03, Oct 16
Find the longest sub-string which is prefix, suffix and also present inside the string
05, Apr 19
Find all substrings with even 1s whose reverse is also present in given String
12, Jan 22
Print n numbers such that their sum is a perfect square
05, Mar 19
Construct an Array such that cube sum of all element is a perfect square
29, May 20
Find minimum number to be divided to make a number a perfect square
19, Jan 17
Rearrangement of a number which is also divisible by it
18, Sep 17
Count number of subsets whose median is also present in the same subset
02, May 19
Count prime pairs whose difference is also a Prime Number
05, Nov 20
Find the Next perfect square greater than a given number
21, Sep 18
Find the Largest N digit perfect square number in Base B
19, May 20
Array range queries to find the number of perfect square elements with updates
14, May 20
Find all Factors of Large Perfect Square Natural Number in O(sqrt(sqrt(N))
30, Mar 20
Count all prime numbers in a given range whose sum of digits is also prime
30, Jun 20
Count N-digit numbers made up of X or Y whose sum of digits is also made up of X or Y
06, Nov 20
Numbers of pairs from an array whose average is also present in the array
07, May 21
Generate a pair of integers from a range [L, R] whose LCM also lies within the range
04, Sep 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
rimjhim_25
@rimjhim_25
Vote for difficulty
Current difficulty :
Medium





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!