首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   45篇
  免费   1篇
  国内免费   16篇
数学   62篇
  2023年   3篇
  2022年   4篇
  2021年   3篇
  2020年   6篇
  2019年   5篇
  2018年   3篇
  2016年   3篇
  2015年   1篇
  2014年   2篇
  2013年   3篇
  2011年   1篇
  2009年   3篇
  2008年   3篇
  2007年   3篇
  2006年   3篇
  2005年   4篇
  2004年   1篇
  2003年   1篇
  2002年   1篇
  2001年   4篇
  1998年   2篇
  1997年   2篇
  1996年   1篇
排序方式: 共有62条查询结果,搜索用时 31 毫秒
1.
2.
3.
4.
We present here some results on the applications of linear recursive sequences of order $2$ to the Fermat pseudoprimes, Fibonacci pseudoprimes, and Dickson pseudoprimes.  相似文献   
5.
6.
We adapt the algorithm of Kolesnikov and Pozhidaev, which converts a polynomial identity for algebras into the corresponding identities for dialgebras, to the Cayley–Dickson doubling process. We obtain a generalization of this process to the setting of dialgebras, establish some of its basic properties, and construct dialgebra analogues of the quaternions and octonions.  相似文献   
7.
Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected. Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.  相似文献   
8.
An explicit construction of polynomials over a finite field of odd characteristic, for which the absolute value of trigonometric sums attains the Weil bound, is based on the construction of cyclic matrices of given rank. Dickson polynomials of the second kind play an essential role in the study of such matrices.__________Translated from Matematicheskie Zametki, vol. 78, no. 1, 2005, pp. 16–25.Original Russian Text Copyright © 2005 by L. A. Bassalygo, V. A. Zinov’ev.  相似文献   
9.
The relativistic first-order wave equations for massive particles with spin 0,1,1/2 are formulated in terms of a factorization of the Klein–Fock equation by means of the algebra of octonions. An analogous method applied to Hamiltonian of the quantum isotropic oscillator leads to the natural generalization of the model. The class of supersymmetric oscillators with dimension N7 associated with te algebras of the Cayley–Dickson series is introduced.  相似文献   
10.
Let q=pr with p=3 and r2. We give a recursion formula for the moments of a Kloosterman sum over the finite field , which utilizes known weight formulae for the ternary Melas code M of length q−1. The method is illustrated by giving explicit formulae for the moments up to the tenth moment. As an application for the formulae, and for their analogues obtained earlier in case p=2, we get the exact number of rational points on fibre products of certain Kloosterman curves. As a corollary we obtain identities between Ramanujan's tau-function, Kronecker class numbers, and Dickson polynomials.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号