MTM Mod computation over the integers modulo m Calling Sequence Parameters Description Examples Calling Sequence Mod( M1 , M2 ) Parameters M1 - array M2 - array Description The Mod(M1,M2) function computes the element-wise M1 modulo M2 . If M1 is a scala
Let the function f:→ satisfy (i) f(n+b)≡f(n)modb for all natural b,n; (ii) f(n)=O(e αn ) where α<1. Then I. Z. Ruzsa conjectured that f is a polynomial. He provided this with e-1 instead of e in (ii). In this paper the author proves it with exp(0,75)≈2...
(wxMaxima屏幕截图) 历史就不贴了,长,大伙儿也不乐意看,反正Maxima的前身是“代数”数学软件Mathematica、Maple的先驱。看到这里,很多人肯定都会有这样几个问题: 1.俺们Matlab用得好好的,干嘛用这个名气不大的Maxima? 诚然,Matlab是一个功能很丰富的数学软件,在国内的使用范围也十分广泛。不过,Matlab是matrix ...
(wxMaxima屏幕截图) 历史就不贴了,长,大伙儿也不乐意看,反正Maxima的前身是“代数”数学软件Mathematica、Maple的先驱。看到这里,很多人肯定都会有这样几个问题: 1.俺们Matlab用得好好的,干嘛用这个名气不大的Maxima? 诚然,Matlab是一个功能很丰富的数学软件,在国内的使用范围也十分广泛。不过,Matlab是matrix ...
Of concern is the differential equation (*)L n y+p(x)y=0, where p is a real valued, continuous function on [a,∞), which has a constant sign, while L n (n ... GD Jones,M Keener - 《Journal of Approximation Theory》 被引量: 2发表: 1989年 ...
Orthogonal cycle systems of the complete graph are studied in [1], [6], [7]. Observe that, if s,t⩽5 then any H(m,n;s,t) is simple. The function composition of the cycles ϕr, for r∈[m], is a permutation, denoted here ωr, on the entries of the Heffter array. ...
Primes of the form x^2+n*y^2 in function fields Let n be a square-free polynomial over F_q, where q is an odd prime power. In this paper, we determine which irreducible polynomials p in F_q[x] can be represented in the form X^2+nY^2 with X, Y in F_q[x]. We rest...
just how to take the derivative of “chained” functions — meaning, function x() calls function g(), and you want the derivative of x(g()). Well, programmers know all about functions; we use them every day, so it’s much easier to imagine the problem now than it was back in ...
Abstract. It is well known that a congruence ax ≡ b (mod n ) has a solution if and only if , and, if the condition is satisfied, the number of incongruent solutions equals . In 2010, Alomair, Clark and Poovendran proved that the congruence ax ≡ b (mod
A finiteness theorem for Galois representations of function fields over finite fields (after Deligne) Revised: just some typos, reorganized a bit the article. It will be published in the VIASM Annual meeting, Hanoi. We give a detailed account of Deligne's l......