@@ -13445,19 +13445,19 @@ def divide(val, d):
1344513445 def is_prime_like(val):
1344613446 v = int(round(val.t)) # t bileşenini yuvarla ve integer'a çevir
1344713447 return v > 1 and isprime(v) # >1 ve asal mı?
13448- """
13449- elif kececi_type == 7: # NeutrosophicNumber
13450- def add(a, b): return a + b
13451- def is_divisible(val, d):
13452- # val.t (T bileşeni) kullan
13453- return math.isclose(val.t % d, 0) if hasattr(val, 't') else False
13454- def divide(val, d):
13455- # Tüm bileşenleri d'ye böl
13456- return type(val)(val.t/d, val.i/d, val.f/d)
13457- def is_prime_like(val):
13458- v = int(round(val.t))
13459- return v > 1 and isprime(v)
13460- """
13448+ """
13449+ elif kececi_type == 7: # NeutrosophicNumber
13450+ def add(a, b): return a + b
13451+ def is_divisible(val, d):
13452+ # val.t (T bileşeni) kullan
13453+ return math.isclose(val.t % d, 0) if hasattr(val, 't') else False
13454+ def divide(val, d):
13455+ # Tüm bileşenleri d'ye böl
13456+ return type(val)(val.t/d, val.i/d, val.f/d)
13457+ def is_prime_like(val):
13458+ v = int(round(val.t))
13459+ return v > 1 and isprime(v)
13460+ """
1346113461
1346213462 elif kececi_type == 8: # NeutrosophicComplexNumber
1346313463 def add(a, b): return a + b
0 commit comments