Spaces:
Runtime error
Runtime error
Update app.py
Browse files
app.py
CHANGED
|
@@ -768,285 +768,7 @@ def compute_Sn_Claude_hard3(a_0, a_1, a_n, b_1, b_n, verbose=True):
|
|
| 768 |
|
| 769 |
return S_n_expr, S_n_str, S_1_expr, S_1_str, S_1_df_expr, S_1_df_str
|
| 770 |
|
| 771 |
-
|
| 772 |
-
"""
|
| 773 |
-
Oblicza S_n = a_0 * Π_{i=1}^{n-1} a_i / Π_{i=1}^{n} b_i.
|
| 774 |
-
Uwzględnia przypadki prowadzące do silni i teleskopowe skracanie się wyrazów.
|
| 775 |
-
POPRAWKA: Uwzględnia jawnie podane a_1 oraz stałe a_n w przypadkach teleskopowych.
|
| 776 |
-
"""
|
| 777 |
-
import sympy as sp
|
| 778 |
-
|
| 779 |
-
if verbose:
|
| 780 |
-
print("Compute S_n:", a_0, a_1, a_n, b_1, b_n)
|
| 781 |
-
|
| 782 |
-
# Konwersje na sympy
|
| 783 |
-
a_n_sym = sp.sympify(a_n) if not isinstance(a_n, sp.Expr) else a_n
|
| 784 |
-
b_n_sym = sp.sympify(b_n) if not isinstance(b_n, sp.Expr) else b_n
|
| 785 |
-
a0_sym = sp.sympify(a_0) if not isinstance(a_0, sp.Expr) else a_0
|
| 786 |
-
a1_sym = sp.sympify(a_1) if not isinstance(a_1, sp.Expr) else a_1
|
| 787 |
-
b1_sym = sp.sympify(b_1) if not isinstance(b_1, sp.Expr) else b_1
|
| 788 |
-
|
| 789 |
-
# Zamień wszystkie symbole 'n' na N_SYMBOL
|
| 790 |
-
a_n_sym = a_n_sym.subs(sp.Symbol('n'), N_SYMBOL)
|
| 791 |
-
b_n_sym = b_n_sym.subs(sp.Symbol('n'), N_SYMBOL)
|
| 792 |
-
n = N_SYMBOL # Użyj globalnego symbolu
|
| 793 |
-
|
| 794 |
-
# Symbol do iteracji (musi być inny niż n)
|
| 795 |
-
i = sp.Symbol("i", integer=True, positive=True)
|
| 796 |
-
|
| 797 |
-
if verbose:
|
| 798 |
-
print(f"a_n_sym: {a_n_sym}, b_n_sym: {b_n_sym}")
|
| 799 |
-
print(f"Używany symbol n: {n}, id: {id(n)}")
|
| 800 |
-
|
| 801 |
-
# KLUCZOWE: Sprawdź, czy a_1 różni się od a_n|_{n=1} w SENSOWNY sposób
|
| 802 |
-
try:
|
| 803 |
-
a_n_at_1 = sp.simplify(a_n_sym.subs(n, 1))
|
| 804 |
-
|
| 805 |
-
# Sprawdź, czy wynik jest NaN, zoo (complex infinity), lub zawiera błędy
|
| 806 |
-
# POPRAWKA: użyj hasattr() aby bezpiecznie sprawdzić atrybuty
|
| 807 |
-
is_nan = getattr(a_n_at_1, 'is_nan', False)
|
| 808 |
-
is_infinite = getattr(a_n_at_1, 'is_infinite', False)
|
| 809 |
-
|
| 810 |
-
is_undefined = (is_infinite or
|
| 811 |
-
is_nan or
|
| 812 |
-
a_n_at_1 == sp.zoo or
|
| 813 |
-
a_n_at_1 == sp.nan)
|
| 814 |
-
|
| 815 |
-
if is_undefined:
|
| 816 |
-
if verbose:
|
| 817 |
-
print(f"a_n|_{{n=1}} = {a_n_at_1} (undefined/błąd)")
|
| 818 |
-
print(f"a_1 (jawne) = {a1_sym}")
|
| 819 |
-
print("✓ Wzór daje błąd dla n=1, ale teleskopy mogą działać!")
|
| 820 |
-
a1_meaningfully_differs = False # Nie blokuj teleskopów
|
| 821 |
-
else:
|
| 822 |
-
a1_meaningfully_differs = not sp.simplify(a1_sym - a_n_at_1).is_zero
|
| 823 |
-
if verbose:
|
| 824 |
-
print(f"a_1 (jawne): {a1_sym}")
|
| 825 |
-
print(f"a_n|_{{n=1}}: {a_n_at_1}")
|
| 826 |
-
if a1_meaningfully_differs:
|
| 827 |
-
print(f"!!! UWAGA: a_1 SENSOWNIE różni się od a_n|_{{n=1}} - blokuję teleskopy !!!")
|
| 828 |
-
else:
|
| 829 |
-
print("✓ a_1 zgadza się z a_n|_{n=1} - wzory specjalne są bezpieczne")
|
| 830 |
-
except Exception as e:
|
| 831 |
-
if verbose:
|
| 832 |
-
print(f"Nie można obliczyć a_n|_{{n=1}}: {e}")
|
| 833 |
-
print(f"Zakładam, że wzór daje błąd - teleskopy mogą działać")
|
| 834 |
-
a1_meaningfully_differs = False # W razie wątpliwości: nie blokuj
|
| 835 |
-
|
| 836 |
-
if verbose:
|
| 837 |
-
print("--- WYKRYWANIE PRZYPADKU SPECJALNEGO ---")
|
| 838 |
-
|
| 839 |
-
# Przypadek specjalny 1: a_n = n oraz b_n = 1 => S_n = a_0 * (n-1)!
|
| 840 |
-
cond_an = sp.simplify(a_n_sym - n)
|
| 841 |
-
cond_bn = sp.simplify(b_n_sym - 1)
|
| 842 |
-
|
| 843 |
-
if verbose:
|
| 844 |
-
print(f"Test a_n = n: {cond_an.is_zero}")
|
| 845 |
-
print(f"Test b_n = 1: {cond_bn.is_zero}")
|
| 846 |
-
|
| 847 |
-
is_special_case_1 = (cond_an.is_zero and cond_bn.is_zero and not a1_meaningfully_differs)
|
| 848 |
-
|
| 849 |
-
if is_special_case_1:
|
| 850 |
-
if verbose:
|
| 851 |
-
print(">>> Wykryto przypadek S_n = a_0*(n-1)! <<<")
|
| 852 |
-
S_n_expr = sp.simplify(a0_sym * sp.factorial(n - 1))
|
| 853 |
-
else:
|
| 854 |
-
# Przypadek specjalny 2: a_n = 1 oraz b_n = n => S_n = a_0 / n!
|
| 855 |
-
cond_an_2 = sp.simplify(a_n_sym - 1)
|
| 856 |
-
cond_bn_2 = sp.simplify(b_n_sym - n)
|
| 857 |
-
|
| 858 |
-
is_special_case_2 = (cond_an_2.is_zero and cond_bn_2.is_zero and not a1_meaningfully_differs)
|
| 859 |
-
|
| 860 |
-
if is_special_case_2:
|
| 861 |
-
if verbose:
|
| 862 |
-
print(">>> Wykryto przypadek S_n = a_0/n! <<<")
|
| 863 |
-
S_n_expr = sp.simplify(a0_sym / sp.factorial(n))
|
| 864 |
-
else:
|
| 865 |
-
# Przypadek specjalny 3: b_n = n²/(n-1)² (teleskopowe skracanie)
|
| 866 |
-
b_n_expanded = sp.expand(b_n_sym * (n-1)**2)
|
| 867 |
-
is_telescopic_square = sp.simplify(b_n_expanded - n**2).is_zero
|
| 868 |
-
|
| 869 |
-
if is_telescopic_square and not a1_meaningfully_differs:
|
| 870 |
-
if verbose:
|
| 871 |
-
print(">>> Wykryto teleskopowe b_n = n²/(n-1)² => iloczyn = n² <<<")
|
| 872 |
-
prod_b_done = n**2
|
| 873 |
-
|
| 874 |
-
# Oblicz a_i standardowo (wzór działa)
|
| 875 |
-
a_i = a_n_sym.subs(n, i)
|
| 876 |
-
prod_a = sp.Product(a_i, (i, 1, n - 1))
|
| 877 |
-
try:
|
| 878 |
-
prod_a_done = prod_a.doit()
|
| 879 |
-
except Exception:
|
| 880 |
-
prod_a_done = prod_a
|
| 881 |
-
|
| 882 |
-
S_n_expr = sp.simplify(a0_sym * prod_a_done / prod_b_done)
|
| 883 |
-
else:
|
| 884 |
-
# Przypadek specjalny 4: a_n = n²/(n-1)² (teleskopowe w liczniku)
|
| 885 |
-
a_n_expanded = sp.expand(a_n_sym * (n-1)**2)
|
| 886 |
-
is_telescopic_square_a = sp.simplify(a_n_expanded - n**2).is_zero
|
| 887 |
-
|
| 888 |
-
if is_telescopic_square_a and not a1_meaningfully_differs:
|
| 889 |
-
if verbose:
|
| 890 |
-
print(">>> Wykryto teleskopowe a_n = n²/(n-1)² => iloczyn = (n-1)² <<<")
|
| 891 |
-
prod_a_done = (n-1)**2
|
| 892 |
-
|
| 893 |
-
b_i = b_n_sym.subs(n, i)
|
| 894 |
-
prod_b = sp.Product(b_i, (i, 1, n))
|
| 895 |
-
try:
|
| 896 |
-
prod_b_done = prod_b.doit()
|
| 897 |
-
except Exception:
|
| 898 |
-
prod_b_done = prod_b
|
| 899 |
-
|
| 900 |
-
S_n_expr = sp.simplify(a0_sym * prod_a_done / prod_b_done)
|
| 901 |
-
else:
|
| 902 |
-
# Przypadek specjalny 5: b_n = n/(n-1) (teleskopowe liniowe)
|
| 903 |
-
b_n_expanded_linear = sp.expand(b_n_sym * (n-1))
|
| 904 |
-
is_telescopic_linear = sp.simplify(b_n_expanded_linear - n).is_zero
|
| 905 |
-
|
| 906 |
-
if is_telescopic_linear and not a1_meaningfully_differs:
|
| 907 |
-
if verbose:
|
| 908 |
-
print(">>> Wykryto teleskopowe b_n = n/(n-1) => iloczyn = n <<<")
|
| 909 |
-
prod_b_done = n
|
| 910 |
-
|
| 911 |
-
# POPRAWKA: Sprawdź, czy a_n jest stałą (nie zależy od n)
|
| 912 |
-
a_i = a_n_sym.subs(n, i)
|
| 913 |
-
|
| 914 |
-
# Jeśli a_i nie zawiera zmiennej i, to jest stałą
|
| 915 |
-
if i not in a_i.free_symbols:
|
| 916 |
-
# a_n jest stałą, więc Π_{i=1}^{n-1} a_i = a_n^(n-1)
|
| 917 |
-
prod_a_done = a_n_sym**(n - 1)
|
| 918 |
-
if verbose:
|
| 919 |
-
print(f">>> a_n jest stałą = {a_n_sym}, iloczyn = {a_n_sym}^(n-1) <<<")
|
| 920 |
-
elif sp.simplify(a_i - 1).is_zero:
|
| 921 |
-
# a_i = 1, więc iloczyn = 1
|
| 922 |
-
prod_a_done = sp.Integer(1)
|
| 923 |
-
if verbose:
|
| 924 |
-
print(">>> a_i = 1, więc iloczyn a = 1 <<<")
|
| 925 |
-
else:
|
| 926 |
-
# Oblicz iloczyn standardowo
|
| 927 |
-
prod_a = sp.Product(a_i, (i, 1, n - 1))
|
| 928 |
-
try:
|
| 929 |
-
prod_a_done = prod_a.doit()
|
| 930 |
-
except Exception:
|
| 931 |
-
prod_a_done = prod_a
|
| 932 |
-
|
| 933 |
-
S_n_expr = sp.simplify(a0_sym * prod_a_done / prod_b_done)
|
| 934 |
-
else:
|
| 935 |
-
# Przypadek specjalny 6: a_n = n/(n-1) (teleskopowe w liczniku)
|
| 936 |
-
a_n_expanded_linear = sp.expand(a_n_sym * (n-1))
|
| 937 |
-
is_telescopic_linear_a = sp.simplify(a_n_expanded_linear - n).is_zero
|
| 938 |
-
|
| 939 |
-
if is_telescopic_linear_a and not a1_meaningfully_differs:
|
| 940 |
-
if verbose:
|
| 941 |
-
print(">>> Wykryto teleskopowe a_n = n/(n-1) => iloczyn = (n-1) <<<")
|
| 942 |
-
prod_a_done = n - 1
|
| 943 |
-
|
| 944 |
-
b_i = b_n_sym.subs(n, i)
|
| 945 |
-
prod_b = sp.Product(b_i, (i, 1, n))
|
| 946 |
-
try:
|
| 947 |
-
prod_b_done = prod_b.doit()
|
| 948 |
-
except Exception:
|
| 949 |
-
prod_b_done = prod_b
|
| 950 |
-
|
| 951 |
-
S_n_expr = sp.simplify(a0_sym * prod_a_done / prod_b_done)
|
| 952 |
-
else:
|
| 953 |
-
# PRZYPADEK OGÓLNY
|
| 954 |
-
if verbose:
|
| 955 |
-
print(">>> Przypadek ogólny <<<")
|
| 956 |
-
|
| 957 |
-
# Tu jest miejsce, gdzie a1_meaningfully_differs ma znaczenie!
|
| 958 |
-
if a1_meaningfully_differs:
|
| 959 |
-
if verbose:
|
| 960 |
-
print(f">>> WAŻNE: Używam jawnego a_1 = {a1_sym} zamiast wzoru <<<")
|
| 961 |
-
|
| 962 |
-
# Iloczyn: a_1 * Π_{i=2}^{n-1} a_i(wzór)
|
| 963 |
-
a_i = a_n_sym.subs(n, i)
|
| 964 |
-
|
| 965 |
-
# POPRAWKA: Sprawdź, czy a_n jest stałą
|
| 966 |
-
if i not in a_i.free_symbols:
|
| 967 |
-
# a_n jest stałą od i=2
|
| 968 |
-
prod_a_done = a1_sym * a_n_sym**(n - 2)
|
| 969 |
-
if verbose:
|
| 970 |
-
print(f">>> a_n jest stałą, używam a_1 * {a_n_sym}^(n-2) <<<")
|
| 971 |
-
else:
|
| 972 |
-
prod_a_rest = sp.Product(a_i, (i, 2, n - 1))
|
| 973 |
-
try:
|
| 974 |
-
prod_a_rest_done = prod_a_rest.doit()
|
| 975 |
-
except Exception as e:
|
| 976 |
-
if verbose:
|
| 977 |
-
print(f"Nie udało się obliczyć prod_a_rest: {e}")
|
| 978 |
-
prod_a_rest_done = prod_a_rest
|
| 979 |
-
|
| 980 |
-
prod_a_done = a1_sym * prod_a_rest_done
|
| 981 |
-
else:
|
| 982 |
-
# Wzór działa dla wszystkich i (lub błędy się skracają)
|
| 983 |
-
a_i = a_n_sym.subs(n, i)
|
| 984 |
-
|
| 985 |
-
# POPRAWKA: Sprawdź, czy a_n jest stałą
|
| 986 |
-
if i not in a_i.free_symbols:
|
| 987 |
-
# a_n jest stałą
|
| 988 |
-
prod_a_done = a_n_sym**(n - 1)
|
| 989 |
-
if verbose:
|
| 990 |
-
print(f">>> a_n jest stałą = {a_n_sym}, iloczyn = {a_n_sym}^(n-1) <<<")
|
| 991 |
-
else:
|
| 992 |
-
prod_a = sp.Product(a_i, (i, 1, n - 1))
|
| 993 |
-
try:
|
| 994 |
-
prod_a_done = prod_a.doit()
|
| 995 |
-
except Exception as e:
|
| 996 |
-
if verbose:
|
| 997 |
-
print(f"Nie udało się obliczyć prod_a: {e}")
|
| 998 |
-
prod_a_done = prod_a
|
| 999 |
-
|
| 1000 |
-
# Oblicz iloczyn mianownika (zawsze standardowo)
|
| 1001 |
-
b_i = b_n_sym.subs(n, i)
|
| 1002 |
-
prod_b = sp.Product(b_i, (i, 1, n))
|
| 1003 |
-
try:
|
| 1004 |
-
prod_b_done = prod_b.doit()
|
| 1005 |
-
except Exception as e:
|
| 1006 |
-
if verbose:
|
| 1007 |
-
print(f"Nie udało się obliczyć prod_b: {e}")
|
| 1008 |
-
prod_b_done = prod_b
|
| 1009 |
-
|
| 1010 |
-
S_n_expr = sp.simplify(a0_sym * prod_a_done / prod_b_done)
|
| 1011 |
-
|
| 1012 |
-
# KLUCZOWE: Agresywnie uprość i zamień n na N_SYMBOL
|
| 1013 |
-
S_n_expr = S_n_expr.subs(sp.Symbol('n'), N_SYMBOL)
|
| 1014 |
-
S_n_expr = aggressive_simplify(S_n_expr)
|
| 1015 |
-
S_n_expr = convert_negative_powers_to_fractions(S_n_expr)
|
| 1016 |
-
S_n_expr = aggressive_simplify(S_n_expr)
|
| 1017 |
-
|
| 1018 |
-
# Konwersja do stringa
|
| 1019 |
-
S_n_str = to_latex_display_chat(S_n_expr)
|
| 1020 |
-
|
| 1021 |
-
# Oblicz S_1 podstawiając n=1
|
| 1022 |
-
try:
|
| 1023 |
-
S_1_expr = sp.simplify(S_n_expr.subs(n, 1))
|
| 1024 |
-
S_1_expr = convert_negative_powers_to_fractions(S_1_expr)
|
| 1025 |
-
S_1_str = to_latex_display_chat(S_1_expr)
|
| 1026 |
-
if verbose:
|
| 1027 |
-
print(f"S_1 obliczone: {S_1_expr}")
|
| 1028 |
-
except Exception as e:
|
| 1029 |
-
if verbose:
|
| 1030 |
-
print(f"Nie udało się obliczyć S_1: {e}")
|
| 1031 |
-
S_1_expr = None
|
| 1032 |
-
S_1_str = "?"
|
| 1033 |
-
|
| 1034 |
-
# Oblicz S_1_df z definicji a0/b1
|
| 1035 |
-
try:
|
| 1036 |
-
S_1_df_expr = sp.simplify(a0_sym / b1_sym)
|
| 1037 |
-
S_1_df_expr = convert_negative_powers_to_fractions(S_1_df_expr)
|
| 1038 |
-
S_1_df_expr = aggressive_simplify(S_1_df_expr)
|
| 1039 |
-
S_1_df_str = to_latex_display_chat(S_1_df_expr)
|
| 1040 |
-
|
| 1041 |
-
if verbose:
|
| 1042 |
-
print(f"S_1_def = a_0/b_1 = {S_1_df_expr}")
|
| 1043 |
-
except Exception as e:
|
| 1044 |
-
if verbose:
|
| 1045 |
-
print(f"Nie udało się obliczyć S_1_df: {e}")
|
| 1046 |
-
S_1_df_expr = None
|
| 1047 |
-
S_1_df_str = "?"
|
| 1048 |
-
|
| 1049 |
-
return S_n_expr, S_n_str, S_1_expr, S_1_str, S_1_df_expr, S_1_df_str
|
| 1050 |
|
| 1051 |
def generate_Sk_ck_product_new(S_n_expr, c_n, verbose=True):
|
| 1052 |
"""
|
|
@@ -1436,7 +1158,7 @@ def parse_recurrence_equation_3(equation_text, compat):
|
|
| 1436 |
|
| 1437 |
# Obliczenie S_n
|
| 1438 |
print("\n=== Obliczanie S_n ===")
|
| 1439 |
-
S_n_expr, S_n_str, S_1_expr, S_1_str, S_1_df_expr, S_1_df_str =
|
| 1440 |
|
| 1441 |
# Obliczenie 1/(S_n * a_n)
|
| 1442 |
try:
|
|
|
|
| 768 |
|
| 769 |
return S_n_expr, S_n_str, S_1_expr, S_1_str, S_1_df_expr, S_1_df_str
|
| 770 |
|
| 771 |
+
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 772 |
|
| 773 |
def generate_Sk_ck_product_new(S_n_expr, c_n, verbose=True):
|
| 774 |
"""
|
|
|
|
| 1158 |
|
| 1159 |
# Obliczenie S_n
|
| 1160 |
print("\n=== Obliczanie S_n ===")
|
| 1161 |
+
S_n_expr, S_n_str, S_1_expr, S_1_str, S_1_df_expr, S_1_df_str = compute_Sn_Claude_hard3(a_0, a_1, a_n, b_1, b_n)
|
| 1162 |
|
| 1163 |
# Obliczenie 1/(S_n * a_n)
|
| 1164 |
try:
|