T. Rao

most citedEffective Primality Test for

p 2^{n} + 1

p

prime,

n > 1

2 citations · 3 across the 4 of their papers we have counts for

collaborators

4 papers

math.NT2022

Extending Lenstra's Primality Test to CM elliptic curves and a new quasi-quadratic Las Vegas algorithm for primality

Tejas Rao

For an elliptic curve with CM by $K$ defined over its Hilbert class field, $E / H$ , we extend Lenstra's finite fields test to generators of norms of certain ideals in $O_{H}$ …

math.NT2018

Relaxing the size constraints on the criterion of Proth

Tejas R. Rao

We add one condition to the theorem of Proth to extend its applicability to $N = k 2^{n} + 1$ where $2^{n} > N^{1/3}$ as opposed to the former constraint of $2^{n} > k$ . This additional condition…

math.NT2018★ 2 cited

Effective Primality Test for $p 2^{n} + 1$ , $p$ prime, $n > 1$

Tejas R. Rao

We develop a simple $O ((lo g n)^{2})$ test as an extension of Proth's test for the primality for $p 2^{n} + 1$ , $p > 2^{n}$ . This allows for the determination of large, non-Sierpinski primes…

math.NT2018★ 1 cited

Primitive Indexes, Zsigmondy Numbers, and Primoverization

Tejas Rao

We define a primitive index of an integer in a sequence to be the index of the term with the integer as a primitive divisor. For the sequences $k^{u} + h^{u}$ and $k^{u} - h^{u}$ , we discern a…

Extending Lenstra's Primality Test to CM elliptic curves and a new quasi-quadratic Las Vegas algorithm for primality

Relaxing the size constraints on the criterion of Proth

Effective Primality Test for p2n+1, p prime, n>1

Primitive Indexes, Zsigmondy Numbers, and Primoverization

Effective Primality Test for $p 2^{n} + 1$ , $p$ prime, $n > 1$