# Journal of Prime Research in Mathematics

Journal of Prime Research in Mathematics (JPRM) ISSN: 1817-3462 (Online) 1818-5495 (Print) is an HEC recognized, Scopus indexed, open access journal which provides a plate forum to the international community all over the world to publish their work in mathematical sciences. JPRM is very much focused on timely processed publications keeping in view the high frequency of upcoming new ideas and make those new ideas readily available to our readers from all over the world for free of cost. Starting from 2020, we publish one Volume each year containing four issues in March, June, September and December. The accepted papers will be published online immediate in the running issue. All issues will be gathered in one volume which will be published in December of every year.

Latest Published Articles

### Flow of an Oldroyd-B fluid over an infinite plate subject to a time-dependent shear stress

JPRM-Vol. 1 (2011), Issue 1, pp. 52 – 62 Open Access Full-Text PDF
Nazish Shahid, Mehwish Rana, M. A. Imran
Abstract: The velocity field and the shear stress corresponding to the unsteady flow of an Oldroyd-B fluid due to an infinite flat plate, subject to a time-dependent shear stress, are established in integral form using the Fourier cosine transform. Similar solutions for Maxwell, Second grade and Newtonian fluids are recovered as limiting cases of general solutions. These solutions satisfy both the governing equations and all imposed initial and boundary conditions. Finally, a comparison between the four models as well as the influence of the pertinent parameters on the fluid motion is underlined by graphical illustrations.

### Shape preserving constrained data visualization using rational functions

JPRM-Vol. 1 (2011), Issue 1, pp. 35 – 51 Open Access Full-Text PDF
Tahira S. Shaikh, Muhammad Sarfraz, Malik Zawwar Hussain
Abstract: This work has been contributed on the visualization of curves and surfaces for constrained data. A rational cubic function, with free shape parameters in its description, has been introduced and used. This function has been constrained to visualize the preservation of shape of the data by imposing constraints on free parameters. The rational cubic curve case has also been extended to a rational bi-cubic partially blended surface to visualize the shape preserving surface to constrained data.

### A common unique random fixed point theorems in S-Metric spaces

JPRM-Vol. 1 (2011), Issue 1, pp. 25 – 34 Open Access Full-Text PDF
Shaban Sedghi, Nabi Shobe
Abstract: In this paper, we present some new definitions of $$S$$-metric spaces and prove some random fixed point theorem for two random functions in complete S-metric spaces. We get some improved versions of several fixed point theorems in S-metric spaces.

### On existence of canonical number system in certain classes of pure algebraic number fields

JPRM-Vol. 1 (2011), Issue 1, pp. 19 – 24 Open Access Full-Text PDF
Abstract: Canonical Number System can be considered as natural generalization of radix representation of rational integers to algebraic integers. We determine the existence of Canonical Number System in two classes of pure algebraic number fields of degree $$2^n$$ and $$n$$.

### Outputs in random $$f$$-ary recursive circuits

JPRM-Vol. 1 (2011), Issue 1, pp. 09 – 18 Open Access Full-Text PDF
Abstract: This paper extends the study of outputs for random recursive binary circuits in Tsukiji and Mahmoud (Algorithmica 31(2001), 403). We show via martingales that a suitably normalized version of the number of outputs in random f-ary recursive circuits converges in distribution to a normal random variate.

### The domination cover pebbling number of the square of a path

JPRM-Vol. 1 (2011), Issue 1, pp. 01 – 08 Open Access Full-Text PDF
A. Lourdusamy, T. Mathivanan
Abstract: Given a configuration of pebbles on the vertices of a connected graph $$G$$, a pebbling move (or pebbling step) is defined as the removal of two pebbles from a vertex and placing one pebble on an adjacent vertex. The domination cover pebbling number, $$ψ(G)$$, of a graph $$G$$ is the minimum number of pebbles that have to be placed on $$V (G)$$ such that after a sequence of pebbling moves, the set of vertices with pebbles forms a dominating set of $$G$$, regardless of the initial configuration. In this paper, we determine the domination cover pebbling number for the square of a path.