Kernel: Python 3 (system-wide)
In [0]:
In [1]:
In [2]:
15
In [6]:
In [7]:
15
In [8]:
1
In [11]:
35324.16724932064
In [1]:
-590.2456472212258
In [2]:
106427.12411496
In [3]:
-617.2337290578675
In [4]:
86340.82364340735
In [5]:
-638.6526204120379
In [8]:
110617.45808025483
In [10]:
-1146.4216498758651
In [12]:
63.75264899616013
In [0]:
In [1]:
-146.8893315528303
In [3]:
2336.89812581878
In [4]:
-146.88918870582367
In [6]:
-2779.6529593304626
In [7]:
2644.0199999999995
In [1]:
-590.2456472212258
In [6]:
[0, 8, 64, 216, 512, 1000]
In [10]:
In [11]:
In [12]:
array([ 0, 8, 64, 216, 512, 1000])
In [37]:
In [9]:
In [39]:
In [42]:
9
In [64]:
In [65]:
---------------------------------------------------------------------------
TypeError Traceback (most recent call last)
<ipython-input-65-1bf3671e8b60> in <module>
----> 1 rec_in([2,3,5])
<ipython-input-64-eeecef688398> in rec_in(n)
6
7 rest= rec_in(n[1:])
----> 8 r=rest+10
9 y=n[:-1]
10 return y
TypeError: can only concatenate list (not "int") to list
In [0]:
In [163]:
In [164]:
6673
In [181]:
In [0]:
In [182]:
715
In [0]:
In [0]:
In [274]:
the p(n) sequences converges when c<1
In [275]:
1
In [276]:
0.4
In [277]:
0.16000000000000003
In [278]:
0.06400000000000002
In [279]:
0.025600000000000008
In [2]:
In [3]:
1
In [5]:
In [6]:
55
Plot f(x) = x^3-x+1 on the interval [-2,2]
In [1]:
In [1]:
---------------------------------------------------------------------------
NameError Traceback (most recent call last)
<ipython-input-1-c97b7dc2d9fb> in <module>
----> 1 x = np.linspace(-2,2,100)
2 y = x**3+1
3 plt.xlabel('x')
4 plt.ylabel('y')
NameError: name 'np' is not defined
In [5]:
[<matplotlib.lines.Line2D at 0x7f1efb9d3df0>]
In [6]:
In [8]:
---------------------------------------------------------------------------
NameError Traceback (most recent call last)
<ipython-input-8-84bca8af7d8c> in <module>
----> 1 rec_max([5,6,7,3,9,3,4])
NameError: name 'rec_max' is not defined
In [0]:
In [13]:
In [14]:
In [18]:
1
In [19]:
490.1382323808438
In [20]:
In [21]:
In [0]:
In [0]:
In [22]:
In [23]:
In [24]:
98.91
In [26]:
1
8
127
In [0]:
In [13]:
[1,
3,
5,
7,
9,
11,
13,
15,
17,
19,
21,
23,
25,
27,
29,
31,
33,
35,
37,
39,
41,
43,
45,
47,
49]
In [7]:
In [8]:
---------------------------------------------------------------------------
NameError Traceback (most recent call last)
<ipython-input-8-1a2e8871728c> in <module>
----> 1 cube_deriv(3,-2,0,5)
<ipython-input-7-56e8ca8586bd> in cube_deriv(a, b, c, d)
1 def cube_deriv(a,b,c,d):
----> 2 y = a*x**3+b*x**2+c*x+d
3 t=3*a*x**(3-1)+2*b*x**(2-1)+1*c*x+d(0)
4 prin(t)
NameError: name 'x' is not defined
In [1]:
In [3]:
array([0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0,
0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0,
1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1,
0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0,
0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0])
In [2]:
In [3]:
In [0]:
In [14]:
In [15]:
array([0, 1, 1, 0, 1, 0, 0, 1, 0, 1])
In [40]:
In [44]:
[]
In [42]:
---------------------------------------------------------------------------
TypeError Traceback (most recent call last)
<ipython-input-42-d85ea1407ed1> in <module>
----> 1 np.mean([filp(10) for i in range(100)])
<__array_function__ internals> in mean(*args, **kwargs)
/usr/local/lib/python3.8/dist-packages/numpy/core/fromnumeric.py in mean(a, axis, dtype, out, keepdims)
3370 return mean(axis=axis, dtype=dtype, out=out, **kwargs)
3371
-> 3372 return _methods._mean(a, axis=axis, dtype=dtype,
3373 out=out, **kwargs)
3374
/usr/local/lib/python3.8/dist-packages/numpy/core/_methods.py in _mean(a, axis, dtype, out, keepdims)
170 ret = ret.dtype.type(ret / rcount)
171 else:
--> 172 ret = ret / rcount
173
174 return ret
TypeError: unsupported operand type(s) for /: 'list' and 'int'
In [70]:
In [71]:
[]
In [85]:
In [86]:
In [74]:
In [90]:
[1 0 1 0 0 0 1 1 0 0]
[0 1 0 0 0 0 1 1 1 1]
[1 0 1 0 1 0 0 0 0 1]
[1 0 1 0 0 1 0 1 1 1]
[0 0 1 1 0 0 0 1 0 0]
[0 1 0 0 1 1 1 1 1 0]
[0 1 1 0 1 1 1 0 1 0]
[0 1 0 0 0 0 0 0 1 1]
[1 1 0 0 1 1 1 1 1 1]
[0 0 1 1 1 1 1 0 0 0]
[0 0 0 0 0 1 1 1 1 0]
[0 1 0 1 1 1 0 0 1 0]
[0 0 1 1 1 1 0 1 0 0]
[1 0 1 1 1 1 0 1 1 1]
[0 1 1 1 1 1 0 0 0 1]
[1 0 0 1 0 1 1 0 1 1]
[1 0 0 0 0 1 1 0 0 1]
[1 1 0 0 1 0 1 0 0 1]
[0 1 0 0 1 0 0 1 1 0]
[0 1 1 0 1 0 0 1 0 1]
[1 0 0 1 0 1 1 0 0 0]
[0 1 1 0 0 1 0 1 0 0]
[0 1 0 1 0 1 1 0 0 1]
[1 0 1 1 0 0 0 1 0 0]
[1 0 1 0 1 1 0 0 0 1]
[1 0 0 1 0 0 0 0 0 0]
[0 1 1 0 1 1 0 1 1 1]
[0 0 0 1 1 0 1 1 0 1]
[0 1 1 0 0 0 1 1 0 1]
[0 1 1 0 0 0 1 0 0 0]
[0 1 0 1 0 0 0 1 0 1]
[0 1 1 0 1 1 1 1 1 0]
[1 0 1 1 0 0 1 0 0 1]
[1 0 0 1 1 0 1 0 0 0]
[1 0 1 1 0 0 1 0 1 1]
[0 1 1 1 0 0 1 1 1 1]
[0 0 0 1 1 1 0 0 0 0]
[1 1 1 1 1 0 1 0 0 1]
[0 0 1 0 0 1 1 1 0 1]
[1 1 0 0 1 1 0 0 0 0]
[0 0 1 0 0 0 1 0 1 1]
[0 0 0 1 0 1 0 1 0 0]
[1 0 0 1 0 0 0 1 0 1]
[1 1 1 1 0 1 1 0 0 0]
[1 0 1 1 0 1 1 0 1 0]
[0 1 1 0 1 0 1 0 1 1]
[0 1 0 0 0 0 1 0 0 1]
[0 0 1 1 0 1 1 1 1 0]
[0 1 1 1 1 1 1 0 0 1]
[1 1 1 0 0 1 1 1 1 1]
[0 1 1 0 0 1 1 0 1 0]
[0 1 1 1 1 1 0 1 1 1]
[0 0 1 0 0 0 0 1 0 0]
[1 0 0 1 0 1 1 1 0 1]
[1 1 0 1 0 1 0 1 1 1]
[1 1 1 1 0 1 0 1 1 1]
[0 0 0 0 1 0 1 0 0 1]
[0 1 1 0 1 0 1 0 0 1]
[1 0 1 0 0 1 0 1 1 1]
[1 0 0 1 1 1 0 1 1 0]
[1 1 1 0 1 1 0 0 1 0]
[0 0 1 1 0 1 0 1 0 1]
[0 0 1 0 1 0 0 0 1 1]
[0 1 0 1 0 1 1 0 0 0]
[1 1 1 0 1 0 0 1 1 0]
[0 0 1 1 0 0 1 1 0 1]
[0 0 0 1 0 0 1 1 0 1]
[0 0 0 1 0 1 1 1 0 0]
[0 0 1 1 1 0 0 0 1 0]
[0 0 0 0 1 0 0 1 1 0]
[0 0 0 0 1 1 1 1 0 1]
[1 0 0 1 1 1 0 0 1 0]
[1 1 0 1 1 0 1 0 1 0]
[1 0 0 0 0 0 1 1 0 0]
[1 1 0 1 0 0 1 1 1 0]
[0 1 0 1 0 0 0 0 0 1]
[1 1 1 1 1 0 0 1 1 0]
[0 1 0 0 1 1 1 0 0 1]
[1 1 0 1 1 1 1 0 0 1]
[0 1 1 0 0 0 1 0 0 0]
[0 0 1 0 1 1 1 1 1 1]
[0 0 0 0 1 1 0 0 0 0]
[0 1 1 1 0 1 1 0 0 1]
[0 1 1 1 1 0 0 1 0 1]
[0 0 1 0 1 0 1 0 0 1]
[0 0 0 0 0 1 0 1 0 1]
[1 0 0 0 0 0 0 0 1 1]
[1 0 1 1 1 1 1 1 1 0]
[0 1 1 0 1 1 0 0 1 1]
[1 0 0 1 1 1 0 0 1 1]
[0 0 0 0 0 0 0 0 1 1]
[1 1 1 1 0 0 1 1 0 0]
[0 1 0 1 1 0 0 1 1 0]
[0 0 0 1 0 0 1 0 0 1]
[1 0 1 0 0 0 0 1 1 0]
[1 1 0 1 0 0 0 1 0 1]
[0 0 0 1 1 0 0 1 0 0]
[1 1 0 0 1 1 1 0 0 0]
[1 1 1 0 1 0 0 1 0 0]
[0 1 1 0 0 1 0 0 0 1]
In [1]:
In [2]:
3
The lightbulb problem Suppose that a company sells lightbulbs in packages of size 1, 2, 6, and 8. If a customer orders 30 bulbs, what is the least number of packages (of any size) that can be used to put this order together?
In [1]:
In [2]:
[1, 1, 2, 2, 3, 1, 2, 1, 2, 2, 3, 2, 3, 2, 3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 4, 5, 4, 5, 4]
4
Suppose that a company sells computer chips in packages of size 1, 5, and 8. Find the least number of packages that can be used to order 20 chips.
In [5]:
In [6]:
[1, 2, 3, 4, 1, 2, 3, 1, 2, 2, 3, 4, 2, 3, 3, 2, 3, 3, 4, 4]
4
In [6]:
In [3]:
In [29]:
[1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] 7 100
0.07
In [0]:
In [0]:
In [0]: