相关论文: Two Problems on Narayana Numbers And Repeated Digi…

Using Kummer's Theorem, we give a necessary and sufficient condition for a Narayana number to be divisible by a given prime. We use this to derive certain properties of the Narayana triangle.

For the Fibonacci numbers $F_n$, we have the self-convolution formula $5 \sum_{i=0}^n F_i F_{n-i} = (2n)F_{n+1} - (n+1)F_n$. We find the corresponding self-convolution formula for the Narayana numbers $R_n$ which satisfy $R_n = R_{n-1} +…

Wu showed that certain sums of products of binomial coefficients modulo 2 are given by the run length transforms of several famous linear recurrence sequences, such as the positive integers, the Fibonacci numbers, the extended Lucas…

An $(a,b)$-difference necklace of length $n$ is a circular arrangement of the integers $0, 1, 2, \ldots , n-1$ such that any two neighbours have absolute difference $a$ or $b$. We prove that, subject to certain conditions on $a$ and $b$,…

In this paper, we find all integers c having at least two representations as a difference between a Fibonacci number and a power of 2.

In this paper we obtain a new parametric solution of the problem of finding two triads of biquadrates with equal sums and equal products.

Suppose that $\theta$ is irrational. Then almost all elements $\nu\in {\mathbb Z}[\theta]$ that may be written as a $k$-fold product of the shifted integers $n+\theta$ $(n\in {\mathbb N})$ are thus represented essentially uniquely.

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…

This paper focuses on greedy expansions, one possible representation of numbers, and on arithmetical operations with them. Performing addition or multiplication some additional digits can appear. We study bounds on the number of such digits…

NP complete problem is one of the most challenging issues. The question of whether all problems in NP are also in P is generally considered one of the most important open questions in mathematics and theoretical computer science as it has…

We show that the product of two consecutive Fibonacci (respectively Lucas) numbers is divisible by the sum of their indices if this sum is a prime number different from 5 and in the form (4r+1)(respectively (4r+3)).

Problems in additive number theory related to sum and difference sets, more general binary linear forms, and representation functions of additive bases for the integers and nonnegative integers.

We introduce a class of doubly indexed real Hermite polynomials and we deal with their related properties like the associated recurrence formulae, Runge's addition formula, generating function and Nielsen's identity.

Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…

In this paper, first, I introduce two-layered numbers. Two-layered numbers are positive integers that their positive divisors except 1 can be partitioned into two disjoint subsets. Similarly, I defined a half-layered number as a positive…

Multiple zeta-star values are variants of multiple zeta values which allow equality in the definition. Similar to the theory of continued fractions, every real number which is greater than $1$ can be realized as an unique infinite multiple…

Adinkras are diagrams that describe many useful supermultiplets in D=1 dimensions. We show that the topology of the Adinkra is uniquely determined by a doubly even code. Conversely, every doubly even code produces a possible topology of an…

We determine all pairs of positive integers $(a,b)$ such that $a+b$ and $a \times b$ have the same decimal digits in reverse order: \[ (2,2), (9,9), (3,24), (2,47), (2,497), (2,4997), (2,49997), \ldots \] We use deterministic finite…

We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…