The effect of high-dose pyridoxine (PN) on mammary tumorigenesis was examined in female Sprague-Dawley rats. The first mammary tumors appeared between 84 and 90 days after 7,12-dimethylbenzanthracene treatment. There was no effect of PN level on tumor incidence at 90 days but at 98, 104, and 111 days. Tumor incidence was lower in the high-dose group (35 mg PN/kg diet) compared with the controls...

PURPOSE To examine the relationship between the distance of axotomy and axonal regeneration of injured retinal ganglion cells (RGCs) systematically and the effect of a predegenerated (pretransected or precrushed) peripheral nerve (PN) graft on axonal regeneration of RGCs axotomized at a definite distance (0.5 mm from the optic disc) in comparison with a normal PN graft. METHODS The optic nerv...

rangeland ecosystem contains various patches with different functions. structural and functional characteristics of rangeland patches are changed by management practices and can be used to interpret management effects. the structural and functional characteristics of fertilized patches in two rangeland ecosystems of ghareh ghir and maraveh tapeh were measured and analyzed in this study. a group...

Recently, there is a need for fostering the critical reflective side of L2 teacher education. This study investigated the implications of personal narrative (PN) and reflective journal (RJ) writing for Iranian EFL teachers’ reflective writing. Sixty (36 women and 24 men) in-service secondary school EFL teachers were selected based on the convenience sampling from Iran. L2 teachers equally divid...

Objectives: To examine rooted products graph and corona product of path with itself cycle for the existence d-lucky labeling. Methods: In this study, number Rooted to (Pn ◦ Pn) Corona (Pn⊙ are computed. Method construction is used throughout paper prove theorems. Findings: admit labeling numbers same obtained. Novelty: some graphs obtained by authors but new findings. Keywords: Proper Lucky lab...

We give a combinatorial proof for a second order recurrence for the polynomials pn(x), where pn(k) counts the number of integer-coordinate lattice points x = (x1, . . . , xn) with ‖x‖ = ∑n i=1|xi| ≤ k. This is the main step to get finiteness results on the number of solutions of the diophantine equation pn(x) = pm(y) if n and m have different parity. The combinatorial approach also allows to ex...

For a projective plane Pn of order n, let X(Pn) denote the minimum number k, so that there is a coloring of the points of P~ in k colors such that no two distinct lines contain precisely the same number' of points of each color. Answering a question of A. Rosa, we show that for all sufficiently large n, 5 < X(Pn) < 8 for every projective plane P, of order n.

In this paper we give a recursive formula for the sequence of primes {pn} and apply it to find a necessary and sufficient condition in order that a prime number pn+1 is equal to pn+2. Applications of previous results are given to evaluate the probability that pn+1 is of the form pn + 2; moreover we prove that the limit of this probability is equal to zero as n goes to ∞. Finally, for every prim...