- Related Questions & Answers
- Check if a number is divisible by 23 or not in C++
- Check if a number is divisible by 41 or not in C++
- Check if a number is Primorial Prime or not in Python
- Check if any large number is divisible by 17 or not in Python
- Check if any large number is divisible by 19 or not in Python
- Python program to check if a number is Prime or not
- Check if a large number is divisible by 11 or not in java
- Check if a large number is divisible by 3 or not in java
- Check if a large number is divisible by 11 or not in C++
- Check if a large number is divisible by 25 or not in C++
- Check if a large number is divisible by 3 or not in C++
- Check if a large number is divisible by 5 or not in C++
- Check if a large number is divisible by 75 or not in C++
- Check if a large number is divisible by 8 or not in C++
- Check if a large number is divisible by 9 or not in C++

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Suppose we have an array called nums and another value k, we have to check whether LCM of nums is divisible by k or not.

So, if the input is like nums = [12, 15, 10, 75] k = 10, then the output will be True as the LCM of the array elements is 300 so this is divisible by 10.

To solve this, we will follow these steps −

- for i in range 0 to size of nums - 1, do
- if nums[i] is divisible by k, then
- return True

- if nums[i] is divisible by k, then
- return False

Let us see the following implementation to get better understanding −

def solve(nums, k) : for i in range(0, len(nums)) : if nums[i] % k == 0: return True nums = [12, 15, 10, 75] k = 10 print(solve(nums, k))

[12, 15, 10, 75], 10

True

Advertisements