Search Results for ""

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...

Ramanujan's two-variable theta function f(a,b) is defined by f(a,b)=sum_(n=-infty)^inftya^(n(n+1)/2)b^(n(n-1)/2) (1) for |ab|<1 (Berndt 1985, p. 34; Berndt et al. 2000). It ...

In 1913, Ramanujan asked if the Diophantine equation of second order 2^n-7=x^2, sometimes called the Ramanujan-Nagell equation, has any solutions other than n=3, 4, 5, 7, and ...

The word "rank" refers to several related concepts in mathematics involving graphs, groups, matrices, quadratic forms, sequences, set theory, statistics, and tensors. In ...

The rank polynomial R(x,y) of a general graph G is the function defined by R(x,y)=sum_(S subset= E(G))x^(r(S))y^(s(S)), (1) where the sum is taken over all subgraphs (i.e., ...

An extended rooted binary tree satisfying the following conditions: 1. Every node has two children, each colored either red or black. 2. Every tree leaf node is colored ...

Given the closed interval [0,x] with x>1, let one-dimensional "cars" of unit length be parked randomly on the interval. The mean number M(x) of cars which can fit (without ...

A repeating decimal, also called a recurring decimal, is a number whose decimal representation eventually becomes periodic (i.e., the same sequence of digits repeats ...

The Riemann-Siegel formula is a formula discovered (but not published) by Riemann for computing an asymptotic formula for the Riemann-Siegel function theta(t). The formula ...

For a real positive t, the Riemann-Siegel Z function is defined by Z(t)=e^(itheta(t))zeta(1/2+it). (1) This function is sometimes also called the Hardy function or Hardy ...