Properties of Carry Value Transformation | Zendy

Suryakanta Pal | Zendy; Sudhakar Sahoo | Zendy; Birendra Kumar Nayak | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Properties of Carry Value Transformation

Author(s) -

Suryakanta Pal,

Sudhakar Sahoo,

Birendra Kumar Nayak

Publication year - 2012

Publication title -

international journal of mathematics and mathematical sciences

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.21

H-Index - 39

eISSN - 1687-0425

pISSN - 0161-1712

DOI - 10.1155/2012/174372

Subject(s) - algorithm , mathematics , computer science

Carry Value Transformation (CVT) is a model of discrete deterministic dynamical system. In the present study, it has been proved that (1) the sum of any two nonnegative integers is the same as the sum of their CVT and XOR values. (2) the number of iterations leading to either CVT=0 or XOR=0 does not exceed the maximum of the lengths of the two addenda expressed as binary strings. A similar process of addition of modified Carry Value Transformation (MCVT) and XOR requires a maximum of two iterations for MCVT to be zero. (3) an equivalence relation is shown to exist on Z×Z which divides the CV table into disjoint equivalence classes

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research