On subset sums of pseudo–recursive sequences

Bakos, Bence and Hegyvári, Norbert and Pálfy, Máté and Yan, Xiao-Hui (2020) On subset sums of pseudo–recursive sequences. Discrete Mathematics Letters, 4. pp. 31-36. ISSN 2664-2557

Preview

Text DML20_v4_p.31_36.pdf Download (371kB) | Preview

Abstract

Let a0 = a 2 N, fMig1i =1 be an infinite set of integers and fb1; b2; : : : ; bkg be a finite set of integers. We say that faig1 i=0 is a pseudo-recursive sequence if an+1 = Mn+1an + bjn+1 (bjn+1 2 fb1; b2; : : : bkg) holds. In the first part of the paper, we investigate the subset sum of a generalized version of A := fan = b2nc : n = 0; 1; 2; : : : g, which is a special pseudorecursive sequence. In the second part, we use A for an encryption algorithm

Actions (login required)

Edit Item