Intereting Posts

analytic functions defined on $A\cup D$
Is there an infinite connected topological space such that every space obtained by removing one point from it is totally disconnected?
Thue-Morse sequence cube-freeness proof from the Book
Show that if there are 101 people of different heights standing in a line
Could someone show me a simple example of something being proved unprovable?
Ideas about Proofs
String Theory: What to do?
solve $x^2 – 25 xy + y^2 = 1$ does it have a solution?
Pseudo-Cauchy sequence
If two real matrices are conjugated over $\mathbb{C}$, are they then also conjugated over $\mathbb{R}$?
Is the size of the Galois group always $n$ factorial?
The diameter of a compact set.
If $n$ is a positive integer, does $n^3-1$ always have a prime factor that's 1 more than a multiple of 3?
Do there exist a non-PIR in which every countably generated prime ideal is principal?
If $\|e_1+e_2+\cdots+e_n\|\leq C$ for all $n$ then $(e_i)_{i=1}^n$ is uniformly equivalent to the basis of $\ell_\infty^n$?

Here is the problem:

Can you determine the smallest natural number $N>0$ not divisible by $10$, such that when you move the last two digits of $N$ to the front, shifting the other digits two places to the right, you end up with $6N$?

For example $N=1234567$ will not work, since $6N=7407402$ whereas moving the last two digits in front results in $6712345$. It is not allowed to fill in zeros in case that helps, so $67012345$ is not an option in the current example. Also note, that the last two digits must remain **in the same order** as they originally were. Also you can only use base 10 numbers.

- I need some help with a GCD and LCM's Problem
- If the sum of positive integers $a$ and $b$ is a prime, their gcd is $1$. Proof?
- $A \in M_3(\mathbb Z)$ be such that $\det(A)=1$ ; then what is the maximum possible number of entries of $A$ that are even ?
- Good Number Theory books to start with?
- Number theory question with automorphic numbers
- Proof for: $(a+b)^{p} \equiv a^p + b^p \pmod p$

The current question was inspired by this other question found on this site.

- Prove that if $3\mid n^2 $ then $3\mid n $.
- Proof by induction that $ 169 \mid 3^{3n+3}-26n-27$
- Prove that if $p$ is an odd prime that divides a number of the form $n^4 + 1$ then $p \equiv 1 \pmod{8}$
- Extending the ordered sequence of 'three-number means' beyond AM, GM and HM
- Proof that $x^2+4xy+y^2=1$ has infinitely many integer solutions
- Show that lcm$(a,b)= ab$ if and only if gcd$(a,b)=1$
- Representation of integers by Fibonacci numbers
- The locker problem - why squares?
- What is the best base to use?
- Is the set of natural numbers closed under subtraction?

If we take $N=100b+a$ with $10^{n-1} < b < 10^n$, then the specified condition is:

$$\begin{align}\\

a10^n+b &=6(100b+a) \\

(10^n-6)a &=599b\\

\end{align}$$

So $599$ is prime and therefore we need $599 \mid (10^n-6)$, that is, $10^n \equiv 6 \bmod 599$. This happens first for $n=297$. To bring $a$ into range, and avoid multiples of $10$, we need to multiple by $61$. In principle, then, we will need $N = \dfrac{6100(10^{297}-6)}{599}+61$

Check the digits out here

I solved the reverse problem first, by mistake. In this version, I shift the first two digits of $N$ to the end, and that gives six times $N$.

$$\begin{align}\\

6(a10^n+b) &=100b+a \\

(6\cdot 10^n-1)a &=94b\\

\end{align}$$

We cannot have $b=(6\cdot 10^n-1)$ so we must have $94 \mid (6\cdot 10^n-1) \implies 47 \mid (6\cdot 10^n-1)$

So the smallest value for which this is feasible is $n=44$, where:

$(6\cdot 10^n-1)/47 = 12765957446808510638297872340425531914893617$

In order for $a$ to have two digits, we need $b$ to be $5$ times this number (giving $a=10$), and

$$N=1063829787234042553191489361702127659574468085$$

First thing to note: your $N$ and $6N$ have the same number of digits.

Since we’re working in base 10, this means we know that our number is less than or equal to $16…6$ and greater than $10…0$, since if we multiple $9…9$ (one less digit than the numbers before) by $6$, we’ll get one digit more than $9…9$ has.

That’s a fairly small window, and also, it gives us the first digit of $N$ as $1$. This narrows down our search for the first digit of $6N$ also: it can be no less than $6$. Thus, the 5th digit of $N$ can be no less than $6$.

Now, let’s say $N = 100b + a$ for $60 < a < 100$ and $1000 < b < 1666$.

Then we also know $6N = 10000a + b$. Then we have that $9999a – 99b$ is divisble by 5, so $101a – b$ is divisible by $5$, thus $a – b$ is divisible by $5$. This tells us that the 6th digit of $N$ is either exactly the 4th digit of $N$ or their difference is $5$.

Let $N$ have $m+1$ digits. We have $N= 100x+10a+b$, where $x$ has $m-1$ digits. Moving the last two digits in front we obtain,

$$6N = 10^ma + 10^{m-1}b + x \implies 600x + 60a + 6b = 10^ma + 10^{m-1}b + x$$

Hence, we need

$$599x = (10^m-60)a + (10^{m-1}-6)b = (10^{m-1}-6)(10a+b)$$

This means $599$ divides $(10^{m-1}-6)(10a+b)$. Further, $10a+b$ is a two digit number and $599$ is a prime. Hence, we need $m$ such that $599$ divides $10^{m-1}-6$. This gives us $m=298,597,\ldots$. I trust you can finish it off from here.

- Normal approximation of tail probability in binomial distribution
- How can I prove $dz=dx+idy$?
- Why are we interested in closed geodesics?
- The equation $x^3 + y^3 = z^3$ has no integer solutions – A short proof
- Why study linear algebra?
- A convex optimization problem over two vectors
- How do I find partners for study?
- There is no smallest rational number greater than 2
- Showing that $(\mathbb{Z}/p^{a}\mathbb{Z})^*$ is a cyclic group
- “If P, then Q; If P, then R; Therefore: If Q, then R.” Fallacy and Transitivity
- Congruence and diagonalizations
- Dot product for 3 vectors
- Is $n! + 1$ often a prime?
- Difference between a proposition and an assertion
- Elementary derivation of certian identites related to the Riemannian Zeta function and the Euler-Mascheroni Constant