Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Server Side Programming Articles
Page 450 of 2109
Check if product of first N natural numbers is divisible by their sum in Python
Suppose we have a number n. We have to check whether the product of (1*2*...*n) is divisible by (1+2+...+n) or not. So, if the input is like num = 5, then the output will be True as (1*2*3*4*5) = 120 and (1+2+3+4+5) = 15, and 120 is divisible by 15. Mathematical Approach Instead of calculating the actual product and sum, we can use a mathematical property. The product of first n natural numbers is n! (factorial), and the sum is n*(n+1)/2. The key insight is: If num + 1 is prime, then the factorial is ...
Read MoreCheck if product of digits of a number at even and odd places is equal in Python
In this problem, we need to check whether the product of digits at odd positions equals the product of digits at even positions in a number. The positions are counted from right to left, starting with position 1. For example, in the number 2364: Odd positions (1st, 3rd): 4, 6 → Product = 4 × 6 = 24 Even positions (2nd, 4th): 3, 2 → Product = 3 × 2 = 6 Let's correct this with a proper example where products are equal ? Algorithm To solve this, we will follow these steps − ...
Read MoreCheck if product of array containing prime numbers is a perfect square in Python
Suppose we have an array nums with all prime numbers. We have to check whether the product of all numbers present in nums is a perfect square or not. A perfect square is formed when every prime factor appears an even number of times. Since our array contains only prime numbers, we need to count the frequency of each prime and ensure all frequencies are even. So, if the input is like nums = [3, 3, 7, 7], then the output will be True as product of all elements in nums is 441 which is a perfect square ...
Read MoreCheck if number is palindrome or not in Octal in Python
A palindrome is a number that reads the same forwards and backwards. In this problem, we need to check if a given number is a palindrome in its octal representation. If the input number is already in octal format (all digits < 8), we check it directly. If it's in decimal format, we first convert it to octal, then check if the result is a palindrome. For example, if the input is 178, it contains digit 8 which is not valid in octal, so it's treated as decimal. Converting 178 to octal gives 262, which is a palindrome. ...
Read MoreCheck if one of the numbers is one's complement of the other in Python
Suppose we have two numbers x and y. We have to check whether one of these two numbers is 1's complement of the other or not. We all know the 1's complement of a binary number is flipping all bits from 0 to 1 or 1 to 0. So, if the input is like x = 9, y = 6, then the output will be True as the binary representations are x = 1001 and y = 0110 which are complement of each other. Algorithm To solve this, we will follow these steps − ...
Read MoreCheck if number can be displayed using seven segment led in Python
Suppose we have a number n and a constraint c. We need to check whether n can be displayed using 7-segment displays with at most c LEDs. Each digit requires a different number of LED segments to be illuminated. For example, if the input is n = 315 and c = 17, the output will be True since 315 needs 12 LEDs (3 needs 5, 1 needs 2, 5 needs 5) and we have 17 available. Seven Segment Display LED Count: ...
Read MoreCheck if N is Strong Prime in Python
A strong prime is a prime number that is greater than the arithmetic mean of its nearest prime neighbors. In other words, if we have a prime number p, and its previous prime is p1 and next prime is p2, then p is strong if p > (p1 + p2) / 2. For example, if we have num = 37, the nearest prime numbers are 31 and 41. The average is (31 + 41) / 2 = 36, and since 37 > 36, it is a strong prime. Algorithm Steps To check if a number is a ...
Read MoreCheck if n is divisible by power of 2 without using arithmetic operators in Python
When we need to check if a number is divisible by a power of 2 without using arithmetic operators, we can use bitwise operations. This approach leverages the binary representation of numbers and bit manipulation. Problem Understanding Given two numbers x and n, we need to check whether x is divisible by 2n without using division, modulo, or other arithmetic operators. For example, if x = 32 and n = 5, we check if 32 is divisible by 25 = 32. Algorithm The key insight is that a number is divisible by 2n if and only ...
Read MoreCheck if N is divisible by a number which is composed of the digits from the set {A, B} in Python
Given a number n and two digits a and b, we need to check if we can form a number using only digits a and b that divides n. This problem can be solved using recursion by generating all possible combinations of numbers formed using the given digits. For example, if n = 115, a = 3, b = 2, then the output will be True because 115 is divisible by 23, which is made of digits 2 and 3. Algorithm Steps To solve this problem, we will follow these steps − ...
Read MoreCheck if N is a Factorial Prime in Python
A factorial prime is a prime number that is either one less than or one more than a factorial of any positive integer. For example, 719 is a factorial prime because 719 = 6! - 1 = 720 - 1, where 6! = 720. In this article, we'll learn how to check if a given number N is a factorial prime in Python. What is a Factorial Prime? A factorial prime has the form n! ± 1, where: n! + 1 (one more than factorial) n! - 1 (one less than factorial) The ...
Read More