Competition problem — Number theory

Library / /99 of 520

Number theory Difficulty 5.6 AIME, harder Find the answer

6. Encipher the message BUY NOW using the knapsack cipher based on the sequence obtained from the super-increasing sequence $(17,19,37,81,160)$ , by performing modular multiplication with multiplier $w=29$ and modulus $m=331$ .

Your answer

A number or a short expression. Spacing and $ signs are ignored.

Solution

6. 6242382306332274

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.