假设gcd函数可正确求解两个正整数的最大公约数，判断findMusicalPattern(4,6)的返回值是否为2

import math

def findMusicalPattern(rhythm1, rhythm2):
    commonDivisor = math.gcd(rhythm1, rhythm2)
    patternLength = (rhythm1 * rhythm2) // commonDivisor