Check that if large number is divisible by 7

Here given code implementation process.

// Java program for
// Check that if large number is divisible by 7
public class Divisibility
{
    public void isDivisibleBy7(String num)
    {
        boolean result = false;
        int sum = 0;
        int sign = 1;
        int temp = 0;
        String auxiliary = num;
        int length = auxiliary.length();
        if(length == 1 && num.charAt(0) == '0')
        {
            result = true;
        }
        else if (length > 0)
        {
            if ((length % 3) == 2)
            {
                // When length divide by 3 remainder is 2
                // Mean need to add one more digit
                auxiliary = "0" + auxiliary;
            }
            else if ((length % 3) == 1)
            {
                // Mean need to add two more digit 
                auxiliary = "00" + auxiliary;
            }
            // Get new length
            length = auxiliary.length();
            for (int i = length - 1; i >= 0; --i)
            {
                temp = (auxiliary.charAt(i) - 48);
                i--;
                temp += (auxiliary.charAt(i) - 48) * 10;
                i--;
                temp += (auxiliary.charAt(i) - 48) * 100;
                sum += (temp * sign);
                sign = sign * -1;
            }
            if ((sum % 7) == 0)
            {
                result = true;
            }
        }
        if (result)
        {
            System.out.println(" Given number (" + 
                               num + ") is divisible by 7");
        }
        else
        {
            System.out.println(" Given number (" + 
                               num + ") is not divisible by 7");
        }
    }
    public static void main(String[] args)
    {
        Divisibility task = new Divisibility();
        // Test
        task.isDivisibleBy7("45645645");
        task.isDivisibleBy7("65765345345");
        task.isDivisibleBy7("34965");
        task.isDivisibleBy7("56456423434545645567567567867867");
        task.isDivisibleBy7("9999");
    }
}

Output

 Given number (45645645) is not divisible by 7
 Given number (65765345345) is divisible by 7
 Given number (34965) is divisible by 7
 Given number (56456423434545645567567567867867) is divisible by 7
 Given number (9999) is not divisible by 7

// Include header file
#include <iostream>
#include <string>

using namespace std;
// C++ program for
// Check that if large number is divisible by 7
class Divisibility
{
	public: void isDivisibleBy7(string num)
	{
		bool result = false;
		int sum = 0;
		int sign = 1;
		int temp = 0;
		string auxiliary = num;
		int length = auxiliary.length();
		if (length == 1 && num[0] == '0')
		{
			result = true;
		}
		else if (length > 0)
		{
			if ((length % 3) == 2)
			{
				// When length divide by 3 remainder is 2
				// Mean need to add one more digit
				auxiliary = "0" +  auxiliary;
			}
			else if ((length % 3) == 1)
			{
				// Mean need to add two more digit 
				auxiliary = "00" +  auxiliary;
			}
			// Get new length
			length = auxiliary.length();
			for (int i = length - 1; i >= 0; --i)
			{
				temp = (auxiliary[i] - 48);
				i--;
				temp += (auxiliary[i] - 48) *10;
				i--;
				temp += (auxiliary[i] - 48) *100;
				sum += (temp *sign);
				sign = sign *-1;
			}
			if ((sum % 7) == 0)
			{
				result = true;
			}
		}
		if (result)
		{
			cout << " Given number (" 
                 << num << ") is divisible by 7" << endl;
		}
		else
		{
			cout << " Given number (" 
                 << num << ") is not divisible by 7" << endl;
		}
	}
};
int main()
{
	Divisibility *task = new Divisibility();
	// Test
	task->isDivisibleBy7("45645645");
	task->isDivisibleBy7("65765345345");
	task->isDivisibleBy7("34965");
	task->isDivisibleBy7("56456423434545645567567567867867");
	task->isDivisibleBy7("9999");
	return 0;
}

Output

 Given number (45645645) is not divisible by 7
 Given number (65765345345) is divisible by 7
 Given number (34965) is divisible by 7
 Given number (56456423434545645567567567867867) is divisible by 7
 Given number (9999) is not divisible by 7

// Include namespace system
using System;
// Csharp program for
// Check that if large number is divisible by 7
public class Divisibility
{
	public void isDivisibleBy7(String num)
	{
		Boolean result = false;
		int sum = 0;
		int sign = 1;
		int temp = 0;
		String auxiliary = num;
		int length = auxiliary.Length;
		if (length == 1 && num[0] == '0')
		{
			result = true;
		}
		else if (length > 0)
		{
			if ((length % 3) == 2)
			{
				// When length divide by 3 remainder is 2
				// Mean need to add one more digit
				auxiliary = "0" + auxiliary;
			}
			else if ((length % 3) == 1)
			{
				// Mean need to add two more digit 
				auxiliary = "00" + auxiliary;
			}
			// Get new length
			length = auxiliary.Length;
			for (int i = length - 1; i >= 0; --i)
			{
				temp = (auxiliary[i] - 48);
				i--;
				temp += (auxiliary[i] - 48) * 10;
				i--;
				temp += (auxiliary[i] - 48) * 100;
				sum += (temp * sign);
				sign = sign * -1;
			}
			if ((sum % 7) == 0)
			{
				result = true;
			}
		}
		if (result)
		{
			Console.WriteLine(" Given number (" + num + ") is divisible by 7");
		}
		else
		{
			Console.WriteLine(" Given number (" + num + ") is not divisible by 7");
		}
	}
	public static void Main(String[] args)
	{
		Divisibility task = new Divisibility();
		// Test
		task.isDivisibleBy7("45645645");
		task.isDivisibleBy7("65765345345");
		task.isDivisibleBy7("34965");
		task.isDivisibleBy7("56456423434545645567567567867867");
		task.isDivisibleBy7("9999");
	}
}

Output

 Given number (45645645) is not divisible by 7
 Given number (65765345345) is divisible by 7
 Given number (34965) is divisible by 7
 Given number (56456423434545645567567567867867) is divisible by 7
 Given number (9999) is not divisible by 7

package main
import "fmt"
// Go program for
// Check that if large number is divisible by 7

func isDivisibleBy7(num string) {
	var result bool = false
	var sum int = 0
	var sign int = 1
	var temp int = 0
	var auxiliary string = num
	var length int = len(auxiliary)
	if length == 1 && num[0] == '0' {
		result = true
	} else if length > 0 {
		if (length % 3) == 2 {
			// When length divide by 3 remainder is 2
			// Mean need to add one more digit
			auxiliary = "0" + auxiliary
		} else if (length % 3) == 1 {
			// Mean need to add two more digit 
			auxiliary = "00" + auxiliary
		}
		// Get new length
		length = len(auxiliary)
		for i := length - 1 ; i >= 0 ; i-- {
			temp = (int(auxiliary[i]) - 48)
			i--
			temp += (int(auxiliary[i]) - 48) * 10
			i--
			temp += (int(auxiliary[i]) - 48) * 100
			sum += (temp * sign)
			sign = sign * -1
		}
		if (sum % 7) == 0 {
			result = true
		}
	}
	if result {
		fmt.Println(" Given number (", num, ") is divisible by 7")
	} else {
		fmt.Println(" Given number (", num, ") is not divisible by 7")
	}
}
func main() {
	
	// Test
	isDivisibleBy7("45645645")
	isDivisibleBy7("65765345345")
	isDivisibleBy7("34965")
	isDivisibleBy7("56456423434545645567567567867867")
	isDivisibleBy7("9999")
}

Output

 Given number (45645645) is not divisible by 7
 Given number (65765345345) is divisible by 7
 Given number (34965) is divisible by 7
 Given number (56456423434545645567567567867867) is divisible by 7
 Given number (9999) is not divisible by 7

<?php
// Php program for
// Check that if large number is divisible by 7
class Divisibility
{
	public	function isDivisibleBy7($num)
	{
		$result = false;
		$sum = 0;
		$sign = 1;
		$temp = 0;
		$auxiliary = $num;
		$length = strlen($auxiliary);
		if ($length == 1 && $num[0] == '0')
		{
			$result = true;
		}
		else if ($length > 0)
		{
			if (($length % 3) == 2)
			{
				// When length divide by 3 remainder is 2
				// Mean need to add one more digit
				$auxiliary = "0".$auxiliary;
			}
			else if (($length % 3) == 1)
			{
				// Mean need to add two more digit 
				$auxiliary = "00".$auxiliary;
			}
			// Get new length
			$length = strlen($auxiliary);
			for ($i = $length - 1; $i >= 0; --$i)
			{
				$temp = (ord($auxiliary[$i]) - 48);
				$i--;
				$temp += (ord($auxiliary[$i]) - 48) * 10;
				$i--;
				$temp += (ord($auxiliary[$i]) - 48) * 100;
				$sum += ($temp * $sign);
				$sign = $sign * -1;
			}
			if (($sum % 7) == 0)
			{
				$result = true;
			}
		}
		if ($result)
		{
			echo(" Given number (".$num.
				") is divisible by 7".
				"\n");
		}
		else
		{
			echo(" Given number (".$num.
				") is not divisible by 7".
				"\n");
		}
	}
}

function main()
{
	$task = new Divisibility();
	// Test
	$task->isDivisibleBy7("45645645");
	$task->isDivisibleBy7("65765345345");
	$task->isDivisibleBy7("34965");
	$task->isDivisibleBy7("56456423434545645567567567867867");
	$task->isDivisibleBy7("9999");
}
main();

Output

 Given number (45645645) is not divisible by 7
 Given number (65765345345) is divisible by 7
 Given number (34965) is divisible by 7
 Given number (56456423434545645567567567867867) is divisible by 7
 Given number (9999) is not divisible by 7

// Node JS program for
// Check that if large number is divisible by 7
class Divisibility
{
	isDivisibleBy7(num)
	{
		var result = false;
		var sum = 0;
		var sign = 1;
		var temp = 0;
		var auxiliary = num;
		var length = auxiliary.length;
		if (length == 1 && num.charAt(0) == '0')
		{
			result = true;
		}
		else if (length > 0)
		{
			if ((length % 3) == 2)
			{
				// When length divide by 3 remainder is 2
				// Mean need to add one more digit
				auxiliary = "0" + auxiliary;
			}
			else if ((length % 3) == 1)
			{
				// Mean need to add two more digit 
				auxiliary = "00" + auxiliary;
			}
			// Get new length
			length = auxiliary.length;
			for (var i = length - 1; i >= 0; --i)
			{
				temp = (auxiliary.charCodeAt(i) - 48);
				i--;
				temp += (auxiliary.charCodeAt(i) - 48) * 10;
				i--;
				temp += (auxiliary.charCodeAt(i) - 48) * 100;
				sum += (temp * sign);
				sign = sign * -1;
			}
			if ((sum % 7) == 0)
			{
				result = true;
			}
		}
		if (result)
		{
			console.log(" Given number (" + num + ") is divisible by 7");
		}
		else
		{
			console.log(" Given number (" + num + ") is not divisible by 7");
		}
	}
}

function main()
{
	var task = new Divisibility();
	// Test
	task.isDivisibleBy7("45645645");
	task.isDivisibleBy7("65765345345");
	task.isDivisibleBy7("34965");
	task.isDivisibleBy7("56456423434545645567567567867867");
	task.isDivisibleBy7("9999");
}
main();

Output

 Given number (45645645) is not divisible by 7
 Given number (65765345345) is divisible by 7
 Given number (34965) is divisible by 7
 Given number (56456423434545645567567567867867) is divisible by 7
 Given number (9999) is not divisible by 7

#  Python 3 program for
#  Check that if large number is divisible by 7
class Divisibility :
	def isDivisibleBy7(self, num) :
		result = False
		sum = 0
		sign = 1
		temp = 0
		auxiliary = num
		length = len(auxiliary)
		if (length == 1 and num[0] == '0') :
			result = True
		elif (length > 0) :
			if ((length % 3) == 2) :
				#  When length divide by 3 remainder is 2
				#  Mean need to add one more digit
				auxiliary = "0" + auxiliary
			elif ((length % 3) == 1) :
				#  Mean need to add two more digit 
				auxiliary = "00" + auxiliary
			
			#  Get new length
			length = len(auxiliary)
			i = length - 1
			while (i >= 0) :
				temp = (ord(auxiliary[i]) - 48)
				i -= 1
				temp += (ord(auxiliary[i]) - 48) * 10
				i -= 1
				temp += (ord(auxiliary[i]) - 48) * 100
				sum += (temp * sign)
				sign = sign * -1
				i -= 1
			
			if ((sum % 7) == 0) :
				result = True
			
		
		if (result) :
			print(" Given number (", num ,") is divisible by 7")
		else :
			print(" Given number (", num ,") is not divisible by 7")
		
	

def main() :
	task = Divisibility()
	#  Test
	task.isDivisibleBy7("45645645")
	task.isDivisibleBy7("65765345345")
	task.isDivisibleBy7("34965")
	task.isDivisibleBy7("56456423434545645567567567867867")
	task.isDivisibleBy7("9999")

if __name__ == "__main__": main()

Output

 Given number ( 45645645 ) is not divisible by 7
 Given number ( 65765345345 ) is divisible by 7
 Given number ( 34965 ) is divisible by 7
 Given number ( 56456423434545645567567567867867 ) is divisible by 7
 Given number ( 9999 ) is not divisible by 7

#  Ruby program for
#  Check that if large number is divisible by 7
class Divisibility 
	def isDivisibleBy7(num) 
		result = false
		sum = 0
		sign = 1
		temp = 0
		auxiliary = num
		length = auxiliary.length
		if (length == 1 && num[0] == '0') 
			result = true
		elsif (length > 0) 
			if ((length % 3) == 2) 
				#  When length divide by 3 remainder is 2
				#  Mean need to add one more digit
				auxiliary = "0" + auxiliary
			elsif ((length % 3) == 1) 
				#  Mean need to add two more digit 
				auxiliary = "00" + auxiliary
			end

			#  Get new length
			length = auxiliary.length
			i = length - 1
			while (i >= 0) 
				temp = (auxiliary[i].ord - 48)
				i -= 1
				temp += (auxiliary[i].ord - 48) * 10
				i -= 1
				temp += (auxiliary[i].ord - 48) * 100
				sum += (temp * sign)
				sign = sign * -1
				i -= 1
			end

			if ((sum % 7) == 0) 
				result = true
			end

		end

		if (result) 
			print(" Given number (", 
                  num ,") is divisible by 7", "\n")
		else
 
			print(" Given number (", 
                  num ,") is not divisible by 7", "\n")
		end

	end

end

def main() 
	task = Divisibility.new()
	#  Test
	task.isDivisibleBy7("45645645")
	task.isDivisibleBy7("65765345345")
	task.isDivisibleBy7("34965")
	task.isDivisibleBy7("56456423434545645567567567867867")
	task.isDivisibleBy7("9999")
end

main()

Output

 Given number (45645645) is not divisible by 7
 Given number (65765345345) is divisible by 7
 Given number (34965) is divisible by 7
 Given number (56456423434545645567567567867867) is divisible by 7
 Given number (9999) is not divisible by 7

import scala.collection.mutable._;
// Scala program for
// Check that if large number is divisible by 7
class Divisibility()
{
	def isDivisibleBy7(num: String): Unit = {
		var result: Boolean = false;
		var sum: Int = 0;
		var sign: Int = 1;
		var temp: Int = 0;
		var auxiliary: String = num;
		var length: Int = auxiliary.length();
		if (length == 1 && num.charAt(0) == '0')
		{
			result = true;
		}
		else if (length > 0)
		{
			if ((length % 3) == 2)
			{
				// When length divide by 3 remainder is 2
				// Mean need to add one more digit
				auxiliary = "0" + auxiliary;
			}
			else if ((length % 3) == 1)
			{
				// Mean need to add two more digit 
				auxiliary = "00" + auxiliary;
			}
			// Get new length
			length = auxiliary.length();
			var i: Int = length - 1;
			while (i >= 0)
			{
				temp = (auxiliary.charAt(i).toInt - 48);
				i -= 1;
				temp += (auxiliary.charAt(i).toInt - 48) * 10;
				i -= 1;
				temp += (auxiliary.charAt(i).toInt - 48) * 100;
				sum += (temp * sign);
				sign = sign * -1;
				i -= 1;
			}
			if ((sum % 7) == 0)
			{
				result = true;
			}
		}
		if (result)
		{
			println(" Given number (" + num + ") is divisible by 7");
		}
		else
		{
			println(" Given number (" + num + ") is not divisible by 7");
		}
	}
}
object Main
{
	def main(args: Array[String]): Unit = {
		var task: Divisibility = new Divisibility();
		// Test
		task.isDivisibleBy7("45645645");
		task.isDivisibleBy7("65765345345");
		task.isDivisibleBy7("34965");
		task.isDivisibleBy7("56456423434545645567567567867867");
		task.isDivisibleBy7("9999");
	}
}

Output

 Given number (45645645) is not divisible by 7
 Given number (65765345345) is divisible by 7
 Given number (34965) is divisible by 7
 Given number (56456423434545645567567567867867) is divisible by 7
 Given number (9999) is not divisible by 7

import Foundation;
// Swift 4 program for
// Check that if large number is divisible by 7
class Divisibility
{
	func isDivisibleBy7(_ num: String)
	{
		var result: Bool = false;
		var sum: Int = 0;
		var sign: Int = 1;
		var temp: Int = 0;
		var auxiliary: String = num;
		var length: Int = auxiliary.count;
		if (length == 1 && Array(num)[0] == "0")
		{
			result = true;
		}
		else if (length > 0)
		{
			if ((length % 3) == 2)
			{
				// When length divide by 3 remainder is 2
				// Mean need to add one more digit
				auxiliary = "0" + auxiliary;
			}
			else if ((length % 3) == 1)
			{
				// Mean need to add two more digit 
				auxiliary = "00" + auxiliary;
			}
			// Get new length
			length = auxiliary.count;
          	let v = Array(auxiliary);
			var i: Int = length - 1;
			while (i >= 0)
			{
				temp = (Int(UnicodeScalar(String(v[i]))!.value) - 48);
				i -= 1;
				temp += (Int(UnicodeScalar(String(v[i]))!.value) - 48) * 
                  10;
				i -= 1;
				temp += (Int(UnicodeScalar(String(v[i]))!.value) - 48) * 
                  100;
				sum += (temp * sign);
				sign = sign * -1;
				i -= 1;
			}
			if ((sum % 7) == 0)
			{
				result = true;
			}
		}
		if (result)
		{
			print(" Given number (", num ,") is divisible by 7");
		}
		else
		{
			print(" Given number (", num ,") is not divisible by 7");
		}
	}
}
func main()
{
	let task: Divisibility = Divisibility();
	// Test
	task.isDivisibleBy7("45645645");
	task.isDivisibleBy7("65765345345");
	task.isDivisibleBy7("34965");
	task.isDivisibleBy7("56456423434545645567567567867867");
	task.isDivisibleBy7("9999");
}
main();

Output

 Given number ( 45645645 ) is not divisible by 7
 Given number ( 65765345345 ) is divisible by 7
 Given number ( 34965 ) is divisible by 7
 Given number ( 56456423434545645567567567867867 ) is divisible by 7
 Given number ( 9999 ) is not divisible by 7

// Kotlin program for
// Check that if large number is divisible by 7
class Divisibility
{
	fun isDivisibleBy7(num: String): Unit
	{
		var result: Boolean = false;
		var sum: Int = 0;
		var sign: Int = 1;
		var temp: Int;
		var auxiliary: String = num;
		var length: Int = auxiliary.length;
		if (length == 1 && num.get(0) == '0')
		{
			result = true;
		}
		else if (length > 0)
		{
			if ((length % 3) == 2)
			{
				// When length divide by 3 remainder is 2
				// Mean need to add one more digit
				auxiliary = "0" + auxiliary;
			}
			else if ((length % 3) == 1)
			{
				// Mean need to add two more digit 
				auxiliary = "00" + auxiliary;
			}
			// Get new length
			length = auxiliary.length;
			var i: Int = length - 1;
			while (i >= 0)
			{
				temp = (auxiliary.get(i).toInt() - 48);
				i -= 1;
				temp += (auxiliary.get(i).toInt() - 48) * 10;
				i -= 1;
				temp += (auxiliary.get(i).toInt() - 48) * 100;
				sum += (temp * sign);
				sign = sign * -1;
				i -= 1;
			}
			if ((sum % 7) == 0)
			{
				result = true;
			}
		}
		if (result)
		{
			println(" Given number (" + num + ") is divisible by 7");
		}
		else
		{
			println(" Given number (" + num + ") is not divisible by 7");
		}
	}
}
fun main(args: Array < String > ): Unit
{
	val task: Divisibility = Divisibility();
	// Test
	task.isDivisibleBy7("45645645");
	task.isDivisibleBy7("65765345345");
	task.isDivisibleBy7("34965");
	task.isDivisibleBy7("56456423434545645567567567867867");
	task.isDivisibleBy7("9999");
}

Output

 Given number (45645645) is not divisible by 7
 Given number (65765345345) is divisible by 7
 Given number (34965) is divisible by 7
 Given number (56456423434545645567567567867867) is divisible by 7
 Given number (9999) is not divisible by 7

« Previous Next »

Mathematics

Calculate simple interest

Calculate compound interest

Check leap year

Split a number into three parts

Sum of n natural numbers

Sum of n fibonacci numbers

Generating Pythagorean Triples

Modular multiplicative inverse

Find the sum of geometric series

Print the given geometric progression

Sum of natural numbers in a range

Generate multiplication table of given number

Find N-th element in geometric progression series

Sieve of eratosthenes

Sieve of Atkin

Sieve of Sundaram

Bitwise Sieve

Count digits in a factorial

Count all perfect divisors of a number

Count all x divisible number in a range

Count Even and Odd numbers in a range

Count factorial numbers in given range

Count the number of possible triangles

Count of common multiples of two numbers in a range

Print given row in pascal triangle

Check if the number is balanced

Find the composite numbers from 1 to n

Find largest multiple of 3 in array of digits

Babylonian method for square root

Check if a number is multiple of 5 or not

Calculate power without using division and multiplication

DFA based division

Check divisibility by 7 without modulus operator

Find the next smallest palindrome in an array

Find day of the week for a given date

Addition of two numbers by using prefix and postfix

Check if number is power of 4

Check if number is power of 3

Check whether a given number is an Polydivisible number or not

Check whether the given number is euclid number or not

Check whether the given number is moran number or not

Check whether the given number is nude number or not

Check whether the given number is buzz number or not

Find largest number without using relational operator

Find the minimum and maximum of integers without using branching

Find the absolute value of integer without using branching

Generating all sub sequence of an array of limited size

Generating all subarrays of an array

Find digital root of a large number efficiently

Sum of XOR of all subarrays

Sum of XOR of all possible subsets

Permutation coefficient program

Check if large number is divisible by 20

Check if large number is divisible by 6

Check if large number is divisible by 11

Check if large number is divisible by 3

Number divisible by 8 using bitwise

Number divisible by 9 using bitwise

Check if large number is divisible by 25

Two elements whose sum is closest to zero

Find the only repetitive number between 1 to n-1

Find most frequent element in an array by using sort

Sum of all integers between two integers

Find Newman–Shanks–Williams prime

Sum of n Fibonacci number in constant time

Sum of initial N Even natural numbers

Average of squares of natural numbers

Sum of squares of first n natural numbers

Sum of squares of first n natural numbers in constant time

Juggler Sequence

Find all numbers having digit product equal to k in 1 to N

Find perfect numbers in a given range

Multiply integer number with 3.5

Sum of cubes of n even natural numbers

Average of cubes of first n natural numbers

Moving average of array elements

Average of first n natural numbers

Checking whether a number is a power of 10

Find combination of k with consecutive absolute difference

Find two numbers whose sum is N and does not contain any digit as K

Find the sum of nth row in pascal's triangle

Segmented Sieve

Check that if large number is divisible by 2

Check that if large number is divisible by 10

Check that if large number is divisible by 9

Check that if large number is divisible by 30

Check that if large number is divisible by 999

Print all sophie germain primes less than n

Print safe prime numbers from 1 to n

Check if a number is full prime number

Find the prime numbers between given range using segmented sieve

Check that if large number is divisible by 15

Check that if large number is divisible by 18

Check that if large number is divisible by 22

Check that if large number is divisible by 12

Check that if large number is divisible by 7

Check that if large number is divisible by 8

Check that if large number is divisible by 24

Check that if large number is divisible by 13

Check that if large number is divisible by 16

Sum of all subarrays of an array efficiently

Determine that if given number is Fibonacci Number

Determine that if given number is full Fibonacci Number

Sum of minimum element of all subarrays of a sorted array

Sum the maximum element of all subarrays of a sorted array

Find index of fibonacci number

Replacing one digit with other in an integer

Generate all unique partitions of a number by iterative approach

Add of two polynomials using array

Multiply two polynomials

Russian peasant multiplication

Calculate factorial of large number

Find sum of digits in factorial of a number

Count all the multiples of 3 and 5 in the initial n natural numbers

Sum of all the multiples of 3 and 5 in n natural numbers

Reducing fractions to lowest terms

Sum of all the multiples of 3 and 7 in n natural numbers

Sum of the multiples of two numbers in n natural numbers

Find the all right truncatable primes in n natural numbers

Find the all left truncatable primes in n natural numbers

Find average without division

Addition of two octal numbers

Count the number of ways to cover given sum

Addition of two hexadecimal numbers

Find nearest Fibonacci number from given number

Find first digit of a number

Find last digit of a number

Comment

Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.

New Comment

Name