What is the smallest positive integer which cannot be formed using the digits 2, 0, 1, 4 in that order? You are allowed to use , exponential, factorials, etc. Be creative, and share what you can get. Let's see how high we can go.
To get started, I have:
For clarity, the only numbers which appear are in that order. You cannot use a greek symbol to present a number ( e.g. . The square root sign is borderline, since it actually represents , but we'd allow it. You can't use cube root, unless you have a 3, as in .
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
5 = 2+0-1 + 4
6 = 2 + 0 X 1 + 4
7 = 2 + 0 + 1 + 4
8 = (2 + 0 X 1) X 4
I can't get 9, maybe something like 2X4 +1?
Log in to reply
9=(2+0+1)4 is allowed?
Log in to reply
If that isn't allowed, there's always (−2−0!)⋅(1−4).
10=(2+0)×(1+4)
Pero no puedo obtener 11...
Log in to reply
11=(2+0!)!+1+4
Log in to reply
12=(2+0+1)×4
13=−20+14
14=2×0+14
15=20+14
16=2+0+14
17=2+0!+14
18=2+(0!+1)4
19=20−14
20=(2+0!)!+14
21=−2−0−1+4!
22=−2+0×1+4!
23=2×0−1+4!
24=2×0×1+4!
25=2×0+1+4!
26=2+0×1+4!
27=2+0+1+4!
28=2+0!+1+4!
29=(2+0!)!−1+4!
30=(2+0!)!×1+4!
31=(2+0!)!+1+4!
32=2((0!+1)4)
33=ϕ((2+0!+1)!)+4!
34=20+14
Is combining digits allowed? How about totient function?
Log in to reply
35=⌊((2+0!)!+1)!⌋÷4
36=(2+0!)!(1×4)
37=⌊ϕ((((2+0!)!)!)⌋+(1×4!)
38=⌈ϕ((((2+0!)!)!)⌉+(1×4!)
39=⌈ϕ((((2+0!)!)!)⌉+1+4!
40=ϕ(ϕ((2+0!)!))×(1+4)
41=⌈((2+0!)!)!⌉+14
42=ϕ(⌈((2+0!)!)!⌉)+1×4!
43=ϕ(⌈((2+0!)!)!⌉)+1+4!
44=⌊2014⌋
45=⌈2014⌉
46=ϕ((⌈ϕ(((2+0!)!)!)⌉)!−1+4!)
47=(⌈ϕ(((2+0!)!)!)⌉)!−1+4!
48=(2+0!+1)!+4!
49=(⌈ϕ(((2+0!)!)!)⌉)!+1+4!
50=⌊201÷4⌋
51=⌈201÷4⌉
52=⌊ϕ(((2+0!)!)!)⌋×1×4
53=ϕ(⌊20!⌋)+1−ϕ(4!)
54=ϕ(⌈((2+0!)!)!⌉)×1×⌊ϕ(4!)⌋
55=ϕ(ϕ(ϕ(((2+0!)!)!)))−1+4!
56=⌈ϕ(((2+0!)!)!)⌉×1×⌈ϕ(ϕ(4!))⌉
57=ϕ(ϕ(ϕ(((2+0!)!)!)))+1+4!
58=ϕ(ϕ(((2+0!)!)!))−⌈ϕ((1+4)!)⌉
59=ϕ(ϕ(((2+0!)!)!))−1−4
60=ϕ(ϕ(((2+0!)!)!))−(1×4)
61=ϕ(ϕ(((2+0!)!)!))+1−4
62=ϕ(ϕ(((2+0!)!)!))−(1×4)
63=ϕ(ϕ(((2+0!)!)!))+1−4
64=(ϕ(ϕ(((2+0!)!)!)))×(14)
65=ϕ(ϕ(((2+0!)!)!))+1+4
66=(ϕ(ϕ(((2+0!)!)!)))×1+4
Log in to reply
What if square roots were not allowed?
Log in to reply
((((((0+1+4)!)!)!)!)!)!, or an arbitrarily large number of factorials, then apply the totient function a number of times such that the number is the desired power of 2, then take log 2. n=log2(ϕ(ϕ(⋯(ϕ(ϕ(((⋯((0+1+4)!)!⋯)!)!)⋯))) This works since repeatedly applying the totient function eventually gives a power of 2, and the totient of a power of 2 is the previous power of 2.
Oh actually I can construct every positive integer. TakeFor example, 50=log2(ϕ501(((0+1+4)!)!)) where ϕn denotes applying the totient function n times. Calculated via Mathematica.
Log in to reply
Log in to reply
the formula for the totient function.
First, I'll assume you knowWhen applying totient to an odd prime, another 2, along with possibly some other odd primes, is generated. With each totient, the power on 2 increases/stays the same unless the number is a power of 2. Eventually, all odd primes are gone, and there is a large power of 2 remaining.
Log in to reply
35=ϕ(ϕ(ϕ((2+0!)!)))−1−4
36=ϕ(ϕ(ϕ((2+0!)!)))×1−4
37=ϕ(ϕ(ϕ((2+0!)!)))+1−4
38=ϕ(ϕ(ϕ((2+0!)!)))−1×ϕ(4)
39=ϕ(ϕ(ϕ((2+0!)!)))+1−ϕ(4)
40=ϕ(ϕ(ϕ((2+0!)!)))+1−ϕ(ϕ(4))
41=ϕ(ϕ(ϕ((2+0!)!)))+1×ϕ(ϕ(4))
42=ϕ(ϕ(ϕ((2+0!)!)))+1×ϕ(4)
43=ϕ(ϕ(ϕ((2+0!)!)))+1+ϕ(4)
44=ϕ(ϕ(ϕ((2+0!)!)))+1×4
45=ϕ(ϕ(ϕ((2+0!)!)))+1+4
46=−2+(0!+1)×4!
47=−ϕ(2)+(0!+1)×4!
48=(2+0×1)×4!
49=ϕ(2)+(0!+1)×4!
50=2+(0!+1)×4!
51=(2+0!)×(1+ϕ9((ϕ(4!)!)))
Log in to reply
48=ϕ(20)×ϕ(14)
34 without the use of square root. Turns out it works very handy with floor/ceiling function and factorials. This is because when we combine 2 and 0 as such: ((2+0!)!)!=720, and apply the functions in different orders, we can get many (possibly infinite) natural numbers.
I honestly don't know, been trying hard to continue after67=ϕ(ϕ((((2+0!)!)!)))−1+4
68=ϕ(ϕ((((2+0!)!)!)))×1+4
69=ϕ(ϕ((((2+0!)!)!)))+1+4
70=ϕ(ϕ((((2+0!)!)!)))+(1+∣4∣)!
71=ϕ(ϕ((((2+0!)!)!)))−1+ϕ(4!)
72=ϕ(ϕ((((2+0!)!)!)))×1+ϕ(4!)
73=ϕ(ϕ((((2+0!)!)!)))+1+ϕ(4!)
74=ϕ(ϕ((((2+0!)!)!)))+ϕ(ϕ(−1+4!))
75=(2+0!)×(1+4!)
76=(20−1)×4
4(2+1)×0!
64 can also equal4φ(201)
33 is alsoLog in to reply
ϕ((2+0!+1)!)+4!=ϕ(24)+24=8+24=32 not 33.
This is probably a better solution sinceLog in to reply
You're smart lol
[(2+0)x4]+1
Log in to reply
Well, this is in the wrong order.
True, we always depend on other functions, disregarding the basic stuffs.
(0!+0!+0!+0!+0!+0!)!=720
2 raised to 0 +1 raised to 4
5 = 2+0-1 + 4
6 = 2 + 0 X 1 + 4
7 = 2 + 0 + 1 + 4
8 = (2 + 0 X 1) X 4
maybe every number can be formed
1,638,400,000,000,000,000=2014
2,432,902,008,176,640,00087,178,291,200=20!14! is a possibility as well if you can use double digits
Noone told me me anything not being able to:
2,432,902,008,176,640,00087,178,291,200!=(20!14!)!
100=20×(1+4)
Are there any people from 2018 that are commenting on this apart from me?
9 = [(2+0)x4]+1