Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Back to Simple Search

Advanced Search

Match of the following rules

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

Currently displaying 1 – 9 of 9

Order by Relevance | Title | Year of publication

Netted matrices.

Stănică, Pantelimon — 2003

International Journal of Mathematics and Mathematical Sciences

Cholesky factorizations of matrices associated with $r$ -order recurrent sequences.

Stănică, Pantelimon — 2005

Integers

Inequalities on linear functions and circular powers.

Stănică, Pantelimon — 2002

JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]

Good lower and upper bounds on binomial coefficients.

Stănică, Pantelimon — 2001

JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]

Inequalities related to rearrangements of powers and symmetric polynomials.

Joiţa, Cezar; Stănică, Pantelimon — 2003

JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]

$F_{1} F_{2} F_{3} F_{4} F_{5} F_{6} F_{8} F_{10} F_{12} = 11!$ .

Luca, Florian; Stănică, Pantelimon — 2006

Portugaliae Mathematica. Nova Série

A proof of two conjectures related to the Erdős-Debrunner inequality.

Frenzen, C.L.; Ionascu, E.J.; Stanica, Pantelimon — 2007

JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]

Linear equations with the Euler totient function

Florian Luca; Pantelimon Stănică — 2007

Acta Arithmetica

Products of factorials modulo p

Florian Luca; Pantelimon Stănică — 2003

Colloquium Mathematicae

We show that if p ≠ 5 is a prime, then the numbers $1 / p (\binom{p}{m ₁, . . ., m_{t}}) | t \geq 1, m_{i} \geq 0 f o r i = 1, . . ., t a n d \sum_{i = 1}^{t} m_{i} = p$ cover all the nonzero residue classes modulo p.

Page 1

Download Results (CSV)