English
Related papers

Related papers: Using Fibonacci factors to create Fibonacci pseudo…

200 papers

Let $\pi$ be a $SL(3,\mathbb Z)$ Hecke-Maass cusp form satisfying the Ramanujan conjecture and the Selberg-Ramanujan conjecture, and let $\chi$ be a primitive Dirichlet character modulo $M$, which we assume to be prime for simplicity. We…

Number Theory · Mathematics 2014-02-18 Ritabrata Munshi

If $\fg$ is a semisimple Lie algebra, we describe the prime factors of $\mcU(\fg)$ that have enough finite dimensional modules. The proof depends on some combinatorial facts about the Weyl group which may be of independent interest. We also…

Representation Theory · Mathematics 2007-05-23 Ian M. Musson , Jeb F. Willenbring

We have studied several generalizations of Fibonacci sequences as the sequences with arbitrary initial values, the addition of two and more Fibonacci subsequences and Fibonacci polynomials with arbitrary bases. For Fibonacci numbers with…

History and Overview · Mathematics 2017-07-31 Merve Özvatan , Oktay K. Pashaev

Much recent progress has been made concerning the probable existence of Odd Perfect Numbers, forming part of what has come to be known as Sylvester's Web Of Conditions. This paper proves some results concerning certain properties of the…

Number Theory · Mathematics 2012-11-21 Siddhartha Basak

We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit…

Number Theory · Mathematics 2020-03-27 Samuel Porritt

A second order polynomial sequence is of Fibonacci-type $\mathcal{F}_{n}$ (Lucas-type $\mathcal{L}_{n}$) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Under certain conditions these polynomials are…

Number Theory · Mathematics 2022-02-17 Rigoberto Florez , J. C. Saunders

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

Number Theory · Mathematics 2014-06-25 Tewodros Amdeberhan

Let $a$ and $b$ be positive integers and let $p$ be an odd prime such that $p=ax^2+by^2$ for some integers $x$ and $y$. Let $\lambda(a,b;n)$ be given by $q\prod_{k=1}^\infty (1-q^{ak})^3(1-q^{bk})^3 = \sum_{n=1}^\infty \lambda(a,b;n)q^n$.…

Number Theory · Mathematics 2010-12-20 Zhi-Hong Sun

The paper is about an arithmetic problem in $\F_2[x]$. We give \emph{admissible} (necessary) conditions satisfied by a set of odd prime divisors of perfect polynomials over $\F_2$. This allows us to prove a new characterization of…

Number Theory · Mathematics 2022-02-17 Luis H. Gallardo , Olivier Rahavandrainy

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

Computational Complexity · Computer Science 2009-11-29 Ido Ben-Eliezer , Shachar Lovett , Ariel Yadin

Recently the anomalous behaviour of Fermions below the Fermi temperature was analysed in detail from different viewpoints. In the present communication we obtain a justification for this anomalous semionic behaviour and also obtain the…

General Physics · Physics 2015-06-26 B. G. Sidharth

Let $B_n$ ($n = 0, 1, 2, ...$) denote the usual $n$-th Bernoulli number. Let $l$ be a positive even integer where $l=12$ or $l \geq 16$. It is well known that the numerator of the reduced quotient $|B_l/l|$ is a product of powers of…

Number Theory · Mathematics 2009-08-08 Bernd C. Kellner

We give necessary conditions satisfied by the set of odd prime divisors of binary perfect polynomials. This allows us to get a new characterization of all the known perfect binary polynomials.

Number Theory · Mathematics 2020-08-18 L. H. Gallardo , O. Rahavandrainy

The paper describes a prime factorization of the Catalan numbers. Odd prime factors are distributed in layers in accordance with Legendre's formula. The content of each layer is a network of the intervals, Chebyshev's Segments. The primes…

Number Theory · Mathematics 2019-08-13 Gennady Eremin

In this paper, we introduce the notion of pseudo-primary elements and pseudo-classical primary elements in an $L$-module $M$ and obtain their characterizations. The aim of the paper is to show $rad(N)\in M$, the radical of $N\in M$ is prime…

Rings and Algebras · Mathematics 2020-06-03 A. V. Bingi , C. S. Manjarekar

In this paper we give a new semiprimality test and we construct a new formula for $\pi ^{(2)}(N)$, the function that counts the number of semiprimes not exceeding a given number $N$. We also present new formulas to identify the $n^{th}$…

Number Theory · Mathematics 2016-08-22 Issam Kaddoura , Samih Abdul-Nabi , Khadija Al-Akhrass

Fibonacci-like polynomials produced by m-ary Huffman codes for absolutely ordered sequences have been described.

Discrete Mathematics · Computer Science 2007-05-23 Alex Vinokur

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

Number Theory · Mathematics 2022-08-17 Michael Drmota , Clemens Müllner , Lukas Spiegelhofer

We obtain new bounds of multivariate exponential sums with monomials, when the variables run over rather short intervals. Furthermore, we use the same method to derive estimates on similar sums with multiplicative characters to which…

Number Theory · Mathematics 2019-02-20 Igor Shparlinski

Using the $q$-Wilf--Zeilberger method and a $q$-analogue of a "divergent" Ramanujan-type supercongruence, we give several $q$-supercongruences modulo the fourth power of a cyclotomic polynomial. One of them is a $q$-analogue of a…

Number Theory · Mathematics 2020-04-23 Victor J. W. Guo
‹ Prev 1 8 9 10 Next ›