Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Find a positive number M such that gcd(N^M, N&M) is maximum

  • Last Updated : 28 May, 2021

Given a number N, the task is to find a positive number M such that gcd(N^M, N&M) is the maximum possible and M < N. The task is to print the maximum gcd thus obtained. 
Examples: 
 

Input: N = 5 
Output: 7 
gcd(2^5, 2&5) = 7 

Input: N = 15 
Output: 5

 

Approach: There are two cases which need to be solved to get the maximum gcd possible. 
 

  • If a minimum of one bit is not set in the number, then M will be a number whose bits are flipped at every position of N. And after that get the maximum gcd.
  • If all bits are set, then the answer will the maximum factor of that number except the number itself.

Below is the implementation of the above approach: 
 

C++




// C++ program to implement above approach
 
#include <bits/stdc++.h>
using namespace std;
 
// Recursive function to count
// the number of unset bits
int countBits(int n)
{
    // Base case
    if (n == 0)
        return 0;
 
    // unset bit count
    else
        return !(n & 1) + countBits(n >> 1);
}
 
// Function to return the max gcd
int maxGcd(int n)
{
 
    // If no unset bits
    if (countBits(n) == 0) {
        // Find the maximum factor
        for (int i = 2; i * i <= n; i++) {
            // Highest factor
            if (n % i == 0) {
                return n / i;
            }
        }
    }
    else {
 
        int val = 0;
        int power = 1;
        int dupn = n;
 
        // Find the flipped bit number
        while (n) {
            // If bit is not set
            if (!(n & 1)) {
                val += power;
            }
 
            // Next power of 2
            power = power * 2;
 
            // Right shift the number
            n = n >> 1;
        }
 
        // Return the answer
        return __gcd(val ^ dupn, val & dupn);
    }
 
    // If a prime number
    return 1;
}
 
// Driver Code
int main()
{
    // First example
    int n = 5;
    cout << maxGcd(n) << endl;
 
    // Second example
    n = 15;
    cout << maxGcd(n) << endl;
 
    return 0;
}
Java



// Java program to implement above approach
 
class GFG
{
 
static int __gcd(int a,int b)
{
    if(b == 0)
    return a;
    return __gcd(b, a % b);
}
 
// Recursive function to count
// the number of unset bits
static int countBits(int n)
{
    // Base case
    if (n == 0)
        return 0;
 
    // unset bit count
    else
        return ((n & 1) == 0 ? 1 : 0) + countBits(n >> 1);
}
 
// Function to return the max gcd
static int maxGcd(int n)
{
 
    // If no unset bits
    if (countBits(n) == 0)
    {
        // Find the maximum factor
        for (int i = 2; i * i <= n; i++)
        {
            // Highest factor
            if (n % i == 0)
            {
                return n / i;
            }
        }
    }
    else
    {
 
        int val = 0;
        int power = 1;
        int dupn = n;
 
        // Find the flipped bit number
        while (n > 0)
        {
            // If bit is not set
            if ((n & 1) == 0)
            {
                val += power;
            }
 
            // Next power of 2
            power = power * 2;
 
            // Right shift the number
            n = n >> 1;
        }
 
        // Return the answer
        return __gcd(val ^ dupn, val & dupn);
    }
 
    // If a prime number
    return 1;
}
 
// Driver Code
public static void main(String[] args)
{
    // First example
    int n = 5;
    System.out.println(maxGcd(n));
 
    // Second example
    n = 15;
    System.out.println(maxGcd(n));
}
}
 
// This code contributed by Rajput-Ji
Python3



# Python 3 program to implement
# above approach
from math import gcd, sqrt
 
# Recursive function to count
# the number of unset bits
def countBits(n):
     
    # Base case
    if (n == 0):
        return 0
 
    # unset bit count
    else:
        return (((n & 1) == 0) +
                  countBits(n >> 1))
 
# Function to return the max gcd
def maxGcd(n):
     
    # If no unset bits
    if (countBits(n) == 0):
         
        # Find the maximum factor
        for i in range(2, int(sqrt(n)) + 1):
             
            # Highest factor
            if (n % i == 0):
                return int(n / i)
         
    else:
        val = 0
        power = 1
        dupn = n
 
        # Find the flipped bit number
        while (n):
             
            # If bit is not set
            if ((n & 1) == 0):
                val += power
 
            # Next power of 2
            power = power * 2
 
            # Right shift the number
            n = n >> 1
         
        # Return the answer
        return gcd(val ^ dupn, val & dupn)
 
    # If a prime number
    return 1
 
# Driver Code
if __name__ == '__main__':
     
    # First example
    n = 5
    print(maxGcd(n))
 
    # Second example
    n = 15
    print(maxGcd(n))
 
# This code is contributed by
# Surendra_Gangwar
C#



// C# program to implement above approach
using System;
class GFG
{
 
static int __gcd(int a,int b)
{
    if(b == 0)
    return a;
    return __gcd(b, a % b);
}
// Recursive function to count
// the number of unset bits
static int countBits(int n)
{
    // Base case
    if (n == 0)
        return 0;
 
    // unset bit count
    else
        return ((n & 1) == 0 ? 1 : 0) + countBits(n >> 1);
}
 
// Function to return the max gcd
static int maxGcd(int n)
{
 
    // If no unset bits
    if (countBits(n) == 0)
    {
        // Find the maximum factor
        for (int i = 2; i * i <= n; i++)
        {
            // Highest factor
            if (n % i == 0)
            {
                return n / i;
            }
        }
    }
    else
    {
 
        int val = 0;
        int power = 1;
        int dupn = n;
 
        // Find the flipped bit number
        while (n > 0)
        {
            // If bit is not set
            if ((n & 1) == 0)
            {
                val += power;
            }
 
            // Next power of 2
            power = power * 2;
 
            // Right shift the number
            n = n >> 1;
        }
 
        // Return the answer
        return __gcd(val ^ dupn, val & dupn);
    }
 
    // If a prime number
    return 1;
}
 
// Driver Code
static void Main()
{
    // First example
    int n = 5;
    Console.WriteLine(maxGcd(n));
 
    // Second example
    n = 15;
    Console.WriteLine(maxGcd(n));
}
}
 
// This code is contributed by mits
PHP



<?php
// PHP program to implement above approach
 
// Recursive function to count
// the number of unset bits
function countBits($n)
{
    // Base case
    if ($n == 0)
        return 0;
 
    // unset bit count
    else
        return !($n & 1) +
                 countBits($n >> 1);
}
 
// Recursive function to return
// gcd of a and b
function gcd($a, $b)
{
 
    // Everything divides 0
    if ($a == 0)
        return $b;
    if ($b == 0)
        return $a;
 
    // base case
    if($a == $b)
        return $a ;
     
    // a is greater
    if($a > $b)
        return gcd($a - $b , $b );
 
    return gcd($a , $b - $a );
}
 
// Function to return the max gcd
function maxGcd($n)
{
 
    // If no unset bits
    if (countBits($n) == 0)
    {
         
        // Find the maximum factor
        for ($i = 2; $i * $i <= $n; $i++)
        {
             
            // Highest factor
            if ($n % $i == 0)
            {
                return floor($n / $i);
            }
        }
    }
    else
    {
        $val = 0;
        $power = 1;
        $dupn = $n;
 
        // Find the flipped bit number
        while ($n)
        {
             
            // If bit is not set
            if (!($n & 1))
            {
                $val += $power;
            }
 
            // Next power of 2
            $power = $power * 2;
 
            // Right shift the number
            $n = $n >> 1;
        }
 
        // Return the answer
        return gcd($val ^ $dupn, $val & $dupn);
    }
 
    // If a prime number
    return 1;
}
 
// Driver Code
 
// First example
$n = 5;
echo maxGcd($n), "\n";
 
// Second example
$n = 15;
echo maxGcd($n), "\n";
 
// This code is contributed by Ryuga
?>
Javascript



<script>
// javascript program to implement above approach
    function __gcd(a , b) {
        if (b == 0)
            return a;
        return __gcd(b, a % b);
    }
 
    // Recursive function to count
    // the number of unset bits
    function countBits(n) {
        // Base case
        if (n == 0)
            return 0;
 
        // unset bit count
        else
            return ((n & 1) == 0 ? 1 : 0) + countBits(n >> 1);
    }
 
    // Function to return the max gcd
    function maxGcd(n) {
 
        // If no unset bits
        if (countBits(n) == 0) {
            // Find the maximum factor
            for (i = 2; i * i <= n; i++) {
                // Highest factor
                if (n % i == 0) {
                    return n / i;
                }
            }
        } else {
 
            var val = 0;
            var power = 1;
            var dupn = n;
 
            // Find the flipped bit number
            while (n > 0) {
                // If bit is not set
                if ((n & 1) == 0) {
                    val += power;
                }
 
                // Next power of 2
                power = power * 2;
 
                // Right shift the number
                n = n >> 1;
            }
 
            // Return the answer
            return __gcd(val ^ dupn, val & dupn);
        }
 
        // If a prime number
        return 1;
    }
 
    // Driver Code
     
        // First example
        var n = 5;
        document.write(maxGcd(n)+"<br/>");
 
        // Second example
        n = 15;
        document.write(maxGcd(n));
 
// This code contributed by aashish1995
</script>
Output: 
7
5
 

My Personal Notes
arrow_drop_up
Previous
Print all internal nodes of a Binary tree
Next

Minimum index i such that all the elements from index i to given index are equal
Recommended Articles
Page :
Generate an array with K positive numbers such that arr[i] is either -1 or 1 and sum of the array is positive
16, May 21
Find the last positive element remaining after repeated subtractions of smallest positive element from all Array elements
10, Sep 21
Find smallest positive number Y such that Bitwise AND of X and Y is Zero
23, Jul 19
Find the minimum positive integer such that it is divisible by A and sum of its digits is equal to B
10, Dec 18
Find minimum positive integer x such that a(x^2) + b(x) + c >= k
15, Apr 19
Minimum number of changes such that elements are first Negative and then Positive
08, Apr 19
Minimum positive integer to divide a number such that the result is an odd
09, Jun 17
Find the number of positive integers less than or equal to N that have an odd number of digits
28, Oct 19
Maximum number of distinct positive integers that can be used to represent N
16, Oct 19
Maximum set of number from the first N natural numbers whose Bitwise AND is positive
21, Oct 21
Count ordered pairs of positive numbers such that their sum is S and XOR is K
26, Oct 18
Smallest positive integer K such that all array elements can be made equal by incrementing or decrementing by at most K
15, Jan 21
Kth smallest positive integer Y such that its sum with X is same as its bitwise OR with X
25, Aug 21
Permutation of first N positive integers such that prime numbers are at prime indices | Set 2
29, Apr 20
Permutation of first N positive integers such that prime numbers are at prime indices
08, Apr 20
Count of permutations of first N positive integers such that sum of any two consecutive numbers is prime
16, Nov 21
Find Nth positive number whose digital root is X
18, Feb 19
Find the smallest positive number missing from an unsorted array | Set 3
01, Aug 19
Find the smallest positive number which can not be represented by given digits
13, Aug 19
K-th smallest positive integer having sum with given number equal to bitwise OR with given number
10, Sep 21
Count positive integers with 0 as a digit and maximum 'd' digits
14, Mar 16
Maximum positive integer divisible by C and is in the range [A, B]
12, Feb 19
Find n positive integers that satisfy the given equations
03, Apr 19
Find array sum after incrementing by K adjacent elements of every positive element M times
20, Sep 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
Striver
@Striver
Vote for difficulty





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!