Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2016 OIM Problems/Problem 6

Revision as of 14:04, 14 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == Let <math>k</math> be a positive integer and <math>a_1, a_2, \cdots a_k</math> be digits. Prove that a positive integer <math>n</math> exists such that the last...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $k$ be a positive integer and $a_1, a_2, \cdots a_k$ be digits. Prove that a positive integer $n$ exists such that the last $2k$ digits of $2^n$ are in this order, $a_1, a_2, \cdots, a_k, b_1, b_2, \cdots, b_k$, for certain digits $b_1, b_2, \cdots, b_k$

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2016_OIM_Problems/Problem_6&oldid=207386"