
    Design a fraud detection algorithm that determines if two suspicious transaction amounts share the same divisor sum pattern, where a matching pattern could indicate automated fraud attempts. The algorithm should calculate and compare the sum of all possible divisors for both transaction amounts to identify potential automated transaction sequences. The system must return true if the divisor sums match, indicating a possible fraudulent pattern, and false otherwise.
    

    
import math

def div_sum(n):
    total = 1
    i = 2
    while i * i <= n:
        if n % i == 0:
            total = total + i + math.floor(n / i)
        i += 1
    return total

def are_equivalent(num1, num2):
    """
    Design a fraud detection algorithm that determines if two suspicious transaction amounts share the same divisor sum pattern, where a matching pattern could indicate automated fraud attempts. The algorithm should calculate and compare the sum of all possible divisors for both transaction amounts to identify potential automated transaction sequences. The system must return true if the divisor sums match, indicating a possible fraudulent pattern, and false otherwise.
    

    """
import math

def div_sum(n):
    total = 1
    i = 2
    while i * i <= n:
        if n % i == 0:
            total = total + i + math.floor(n / i)
        i += 1
    return total

def are_equivalent(num1, num2):
    """
    Design a fraud detection algorithm that determines if two suspicious transaction amounts share the same divisor sum pattern, where a matching pattern could indicate automated fraud attempts. The algorithm should calculate and compare the sum of all possible divisors for both transaction amounts to identify potential automated transaction sequences. The system must return true if the divisor sums match, indicating a possible fraudulent pattern, and false otherwise.
    

    """
    return div_sum(num1) == div_sum(num2)