Sciweavers

2904 search results - page 37 / 581
» Number Forms in the Brain
Sort
View
MOC
2000
71views more  MOC 2000»
13 years 7 months ago
The third largest prime divisor of an odd perfect number exceeds one hundred
Let (n) denote the sum of positive divisors of the natural number n. Such a number is said to be perfect if (n) = 2n. It is well known that a number is even and perfect if and only...
Douglas E. Iannucci
DM
2011
318views Education» more  DM 2011»
13 years 2 months ago
The Legendre-Stirling numbers
Abstract. The Legendre-Stirling numbers were discovered in 2002 as a result of a problem involving the spectral theory of powers of the classical second-order Legendre di¤erential...
George E. Andrews, Wolfgang Gawronski, Lance L. Li...
FPL
2007
Springer
106views Hardware» more  FPL 2007»
14 years 1 months ago
Monte Carlo Logarithmic Number System for Model Predictive Control
Simple algorithms can be analytically characterized, but such analysis is questionable or even impossible for more complicated algorithms, such as Model Predictive Control (MPC). ...
Panagiotis D. Vouzis, Sylvain Collange, Mark G. Ar...
ASIACRYPT
1999
Springer
13 years 12 months ago
How to Prove That a Committed Number Is Prime
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan
MOC
2002
132views more  MOC 2002»
13 years 7 months ago
Comparison of algorithms to calculate quadratic irregularity of prime numbers
In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k0, using the values of the zeta functi...
Joshua Holden