# Question: hey i was wondering if there was any way to...

###### Question details

Hey I was wondering if there was any way to find the smallest multiple of a prime number greater than any given n. For example, let's assume I have a 100 and I want to find the smallest number greater than 100 that's a multiple of 7. I do not want to use any loops. I was wondering if there was any property of prime numbers or numbers in general that could help me directly.