suggested details

sagemath · Sep 4, 2024 · 83f075e · 83f075e
1 parent 9b02e5a
commit 83f075e
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/src/sage/combinat/designs/subhypergraph_search.pyx b/src/sage/combinat/designs/subhypergraph_search.pyx
@@ -180,7 +180,7 @@ cdef hypergraph h_init(int n,list H) noexcept:
     cdef hypergraph h
     h.n          = n
     h.m          = len(H)
-    h.limbs      = (n+63)//64 # =ceil(n/64)
+    h.limbs      = (n+63) // 64  # =ceil(n/64)
     h.names      = <int *>  sig_malloc(sizeof(int)*n)
     h.sets       = <uint64_t **> sig_malloc(h.m*sizeof(uint64_t *))
     h.set_space  = <uint64_t *>  sig_calloc(h.m*(h.limbs+1),sizeof(uint64_t))

diff --git a/src/sage/schemes/elliptic_curves/mod_sym_num.pyx b/src/sage/schemes/elliptic_curves/mod_sym_num.pyx
@@ -456,7 +456,7 @@ cdef int best_proj_point(llong u, llong v, llong N,
     else:  # cases like (p:q) mod p*q drop here
         p = llgcd(u, N)
         q = llgcd(v, N)
-        Nnew = N // p // q
+        Nnew = (N // p) // q
         w = ((u // p) * llinvmod(v // q, Nnew)) % Nnew
         y0 = N // q
         y1 = <llong>0