相关论文: Arithmetic of the Fabius function

In this article, we study bent functions on $\mathbb{F}_2^{2m}$ of the form $f(x,y) = x \cdot \phi(y) + h(y)$, where $x \in \mathbb{F}_2^{m-1} $ and $ y \in \mathbb{F}_2^{m+1}$, which form the generalized Maiorana-McFarland class (denoted…

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

We show that every $(2^n,2^n,2^n,1)$-relative difference set $D$ in $\Z_4^n$ relative to $\Z_2^n$ can be represented by a polynomial $f(x)\in \F_{2^n}[x]$, where $f(x+a)+f(x)+xa$ is a permutation for each nonzero $a$. We call such an $f$ a…

In this paper, it is shown that if F(x , y) is an irreducible binary form with integral coefficients and degree $n \geq 3$, then provided that the absolute value of the discriminant of F is large enough, the equation |F(x , y)| = 1 has at…

E26 in the Enestrom index. Translated from the Latin original, "Observationes de theoremate quodam Fermatiano aliisque ad numeros primos spectantibus" (1732). In this paper Euler gives a counterexample to Fermat's claim that all numbers of…

The arithmetic function of two variables is defined. Some properties of the function are given along with the formula that is an analog of the so-called Mobius' inversion formula. A heuristic statement is suggested.

Ramanujan gave a recurrence relation for the partition function in terms of the sum of the divisor function $\sigma(n)$. In 1885, J.W. Glaisher considered seven divisor sums closely related to the sum of the divisors function. We develop a…

There is a well-known factorization of the number $2^{2m}+1$, with $m$ odd, related to the orders of tori of simple Suzuki groups: $2^{2m}+1$ is a product of $a=2^m+2^{(m+1)/2}+1$ and $b=2^m-2^{(m+1)/2}+1$. By the Bang-Zsigmondy theorem,…

We give a proof and extension of two formulas of Frobenius and Stickelberger of Differential Calculus that they used in a fundamental paper concerning elliptic functions theory. Our main ingredient is the introduction of a bilinear form…

The integer $d=\prod_{i=1}^s p_i^{b_i}$ is called an exponential divisor of $n=\prod_{i=1}^s p_i^{a_i}>1$ if $b_i \mid a_i$ for every $i\in \{1,2,...,s\}$. Let $\tau^{(e)}(n)$ denote the number of exponential divisors of $n$, where…

Two elementary formulae for Mertens function $M(n)$ are obtained. With these formulae, $M(n)$ can be calculated directly and simply, which can be easily implemented by computer. $M (1) \sim M (2 \times 10^7) $ are calculated one by one.…

We present a method for tabulating all cubic function fields over $\mathbb{F}_q(t)$ whose discriminant $D$ has either odd degree or even degree and the leading coefficient of $-3D$ is a non-square in $\mathbb{F}_{q}^*$, up to a given bound…

We study the problem of determining the minimum number $f(n,k,d)$ of affine subspaces of codimension $d$ that are required to cover all points of $\mathbb{F}_2^n\setminus \{\vec{0}\}$ at least $k$ times while covering the origin at most…

In 1990, Backelin showed that the number of numerical semigroups with Frobenius number $f$ approaches $C_i \cdot 2^{f/2}$ for constants $C_0$ and $C_1$ depending on the parity of $f$. In this paper, we generalize this result to semigroups…

We present a $q$-analog of the super Catalan number $(2m)!(2n)!/2m!n!(m+n)!$, which also generalizes the $q$-Catalan numbers $c_n(\lambda)$, due to F\"urlinger and Hofbauer, for $\lambda=0$ and $\lambda=1$. We give a combinatorial…

The title equations were originally solved by making use of certain results on hypergeometric functions. Aside from these results, the classifications of the solutions uses very elementary arithmetic. The goal of this is to show that these…

Let $f=\sum_{n=0}^\infty f_n x^n \in \overline{\mathbb Q}[[x]$ be a solution of an algebraic differential equation $Q(x,y(x), \ldots, y^{(k)}(x))=0$, where $Q$ is a multivariate polynomial with coefficients in $\overline{\mathbb Q}$. The…

Using mostly elementary results and functions from probability, we prove Wallis's formula for pi: pi/2 = prod_n (2n * 2n) / ((2n-1) * (2n+1)). The proof involves normalization constants and the Gamma function, Standard normal, and the…

In this paper, we consider the equation $(a^n-2^{m})(b^n-2^{m})=x^2$. By assuming the abc conjecture is true, in [8], Luca and Walsh gave a theorem, which implies that the above equation has only finitely many solutions $n,x$ if a and b are…

In this work, we completely characterize (i) permutation binomials of the form $x^{{{2^n -1}\over {2^t-1}}+1}+ ax \in \mathbb{F}_{2^n}[x], n = 2^st, a \in \mathbb{F}_{2^{2t}}^{*}$, and (ii) permutation trinomials of the form…