primitive sequences
Recently Published Documents


TOTAL DOCUMENTS

52
(FIVE YEARS 4)

H-INDEX

9
(FIVE YEARS 0)

2021 ◽  
Vol 27 (3) ◽  
pp. 39-43
Author(s):  
Ilias Laib ◽  
◽  

In this note, we construct a new set \boldsymbol{S} of primitive sets such that for any real number x\geq 60 we get: \begin{equation*} \sum\limits_{a\in \mathcal{A}}\frac{1}{a(\log a+x)}>\sum\limits_{p\in \mathcal{P}}\frac{1}{p(\log p+x)},\text{ }\mathcal{A\in }{\boldsymbol{S}}, \end{equation*} where \mathcal{P} denotes the set of prime numbers.


2021 ◽  
Vol 52 ◽  
pp. 37-42
Author(s):  
Ilias Laib

A sequence A of strictly positive integers is said to be primitive if none of its term divides another. Z. Zhang proved a result, conjectured by Erdős and Zhang in 1993, on the primitive sequences whose the number of the prime factors of its terms counted with multiplicity is at most 4. In this paper, we extend this result to the primitive sequences whose the number of the prime factors of its terms counted with multiplicity is at most 5.


2020 ◽  
Vol 26 (4) ◽  
pp. 68-73
Author(s):  
Nadir Rezzoug ◽  
◽  
Ilias Laib ◽  
Guenda Kenza ◽  
◽  
...  

For x large enough, there exists a primitive sequence \mathcal{A}, such that \begin{equation*} \sum\limits_{a\in \mathcal{A}}\frac{1}{a(\log a+x)}\gg \sum\limits_{p\in \mathcal{P}}\frac{1}{p(\log p+x)}\text{,} \end{equation*} where \mathcal{P} denotes the set of prime numbers.


Author(s):  
Jianming Xu ◽  
◽  
Lingxin Kong ◽  
Yaodong Wang

The initial iterative control signal is often adopted a zero or a certain value in the conventional iterative learning control (ILC) system, and an ILC process needs to renew again as long as the desired trajectory is changed. In this paper, the NURBS (Non-Uniform Rational B-Splines) model is used for describing all trajectory primitives and the desired trajectory. It is studied that the problem of the initial iterative control signal is extracted in ILC, which presents a method of extracting the initial iterative control signal based on the trajectory primitive optimal matching and combining algorithm. Firstly, the definition of the similarity index between the two different spacial trajectories is introduced. Secondly, an optimal matching and combining algorithm is designed under a certain similarity index, which is used to find two or more combined primitive sequences with space patterns similar to the desired trajectory. Thirdly, the initial iterative control signals of the desired trajectory are extracted by using the control information of the combined primitive sequences. Finally, the simulation is carried out to demonstrate the effectiveness of the present method.


2015 ◽  
Vol 8 (3) ◽  
pp. 371-381 ◽  
Author(s):  
Yuan Cheng ◽  
Wen-Feng Qi ◽  
Qun-Xiong Zheng ◽  
Dong Yang
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document