Results 61 to 70 of about 1,693 (108)
Irrational numbers associated to sequences without geometric progressions [PDF]
Let s and k be integers with s \geq 2 and k \geq 2. Let g_k^{(s)}(n) denote the cardinality of the largest subset of the set {1,2,..., n} that contains no geometric progression of length k whose common ratio is a power of s.
Nathanson, Melvyn B., O'Bryant, Kevin
core
Generalizations of some identities involving the fibonacci numbers [PDF]
In this paper we study the sum $$\sum_{j_1+j_2+...+j_d=n}\prod_{i=1}^d F_{k\cdot j_i},$$ where $d\geq2$ and $k\geq1$.
arxiv
On some monotonic combinatorial sequences conjectures [PDF]
Here we prove some conjectures on the monotony of combinatorial sequences from the recent preprint of Zhi--Wei Sun.
arxiv
On the number of outer connected dominating sets of graphs
Let $G=(V,E)$ be a simple graph. A set $S\subseteq V(G)$ is called an outer-connected dominating set (or ocd-set) of $G$, if $S$ is a dominating set of $G$ and either $S=V(G)$ or $V\backslash S$ is a connected graph.
Akhbari, Mohammad H.+2 more
core
The study of special functions has become an enthralling area in mathematics because of its properties and wide range of applications that are relevant into other fields of knowledge.
Corcino Cristina B.+2 more
doaj +1 more source
Fully degenerate poly-Bernoulli numbers and polynomials
In this paper, we introduce the new fully degenerate poly-Bernoulli numbers and polynomials and inverstigate some properties of these polynomials and numbers.
Kim Taekyun, Kim Dae San, Seo Jong-Jin
doaj +1 more source
Incomplete Generalized Fibonacci and Lucas Polynomials [PDF]
In this paper, we define the incomplete h(x)-Fibonacci and h(x)-Lucas polynomials, we study recurrence relations and some properties of these ...
arxiv
Exponent Lifting Property of Integer Sequences [PDF]
The purpose of this paper is to investigate integer sequences with exponent lifting property, a property common in Fibonacci or Lucas sequences.
arxiv
Generalised Binomial coefficients and Jarden's Theorem [PDF]
We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functionsComment: A section (section 3) concerning the application of Jarden's Theorem is ...
Cheng Lien, Lang, Mong Lung Lang
core
We prove that it is always possible to find a permutation $p$ on the set $\{1,...,n\}$ such that $c+p(c)$ is prime for all $c \in \{1,...,n\}.$
arxiv