相关论文: Two Problems on Narayana Numbers And Repeated Digi…
It is conjectured that for a perfect number $m,$ $\rm{rad}(m)\ll m^{\frac{1}{2}}.$ We prove bounds on the radical of multiperfect number $m$ depending on its abundancy index. Assuming the ABC conjecture, we apply this result to study gaps…
We introduce the continued logarithm representation of real numbers and prove results on the occurrence and frequency of digits with respect to this representation
We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…
Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the_projections_. We are interested in the problem of reconstructing a tiling…
We define a weighted analog for the multidimensional Catalan numbers, obtain matrix-based recurrences for some of them, and give conditions under which they are periodic. Building on this framework, we introduce two new sequences of…
In this article, we try to explain and unify standard divisibility tests found in various books. We then look at recurring decimals, and list a few of their properties. We show how to compute the number of digits in the recurring part of…
We introduce and study the recursive divisor function, a recursive analog of the usual divisor function: $\kappa_x(n) = n^x + \sum_{d\lfloor n} \kappa_x(d)$, where the sum is over the proper divisors of $n$. We give a geometrical…
We introduce a refinement of Boolean-Catalan numbers and call them Boolean-Narayana numbers. We provide an explicit formula for these numbers, and prove unimodality, log-concavity, and real-roots-only results for their sequences. We also…
A natural number N is said to be palindromic if its binary representation reads the same forwards and backwards. In this paper we study the quotients of two palindromic numbers and answer some basic questions about the resulting sets of…
We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial…
Every natural number greater than two may be written as the sum of a prime and a square-free number. We establish several generalisations of this, by placing divisibility conditions on the square-free number.
We give a simple proof that the the number of Dyck paths of semilength $n$ with $i$ returns to ground level and $j$ peaks is the generalized Narayana number $\frac{i}{n} \binom{n}{j} \binom{n - i - 1}{j - i}$.
The derivation of the quantum retrodictive probability formula involves an error, an ambiguity. The end result is correct because this error appears twice, in such a way as to cancel itself. In addition, however, the usual expression for…
In this paper we first determine all irreducible representations of a wedge product of two table algebras in terms of the irreducible representations of two factors involved. Then we give some necessary and sufficient conditions for a table…
We investigate integer numbers which possess at the same time the properties to be triangulars and squares, that are, numbers $a$ for which do exist integers $m$ and $n$ such that $ a = n^2 = \frac{m \cdot (m+1)}{2} $. In particular, we are…
Computational complexity of the design problem for a network with a target value of Region-Based Component Decomposition Number (RBCDN) has been proven to be NP-complete.
Pandigital and penholodigital numbers are numbers that contain every digit or nonzero digit respectively. We study properties of pandigital or penholodigital numbers that are also square, oblong or prime.
Every continuous function of two or more real variables can be written as the superposition of continuous functions of one real variable along with addition.
What is called "numerical reproducibility" is the problem of getting the same result when the scientific computation is run several times, either on the same machine or on different machines, with different types and numbers of processing…
Several operations can be defined on the set of all linear recurrent sequences, such as the binomial convolution (Hurwitz product) or the multinomial convolution (Newton product). Using elementary techniques, we prove that this set equipped…