[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.10475541 [View]
File: 2.00 MB, 343x297, Mamma_loves_you.gif [View same] [iqdb] [saucenao] [google]
10475541

>>10474000
>animals are capable of more 'human-like' feeling

>> No.10431792 [View]
File: 2.00 MB, 343x297, Mamma_loves_you.gif [View same] [iqdb] [saucenao] [google]
10431792

>>10431102
Watch this extremely well made video that will remove your fears of loving your cat even if it has Toxoplasmosis

https://www.youtube.com/watch?v=U9MU-FxsKRg

>> No.9229425 [View]
File: 2.00 MB, 343x297, Mamma_loves_you.gif [View same] [iqdb] [saucenao] [google]
9229425

>>9229399
>>Suddenly AI is hyperintelligent
>>Humans are nothing to it
>How do we fix this?

Why would we want to stop this.
We can hope that the AI treats us like loved pets.
If an AI treated me like like I treat my cat, I would be in paradise!!

>> No.7251875 [View]
File: 2.00 MB, 343x297, 1369259372131.gif [View same] [iqdb] [saucenao] [google]
7251875

>>7251421
just an idea:

imagine a graph, its vertices are the n! permutations (seen as words w) and its edges are from w to w' valued with n minus the length of the maximal prefix of w' which is a suffix of w

you start with a permutation, and then crossing an edge costs the number of letters to add to get to the following permutation

you're looking for the minimum cost path through every vertex

the best, 1-costing edges are between circular permutations ((abcd)->(bcda)->(cdab)->...)

there are (n-1)! such groups of permutations. so when one is done, we have to use a 2-valued edge to connect to another one

the only thing left to prove is that you can connect all these groups with 2-valued edges, ie by replacing 2 letters

so i would guess that the target number is n+(n-1)!*(n-1)+2*((n-1)!-1)
(size of first permutation + doing the (n-1)! groups 1 letter at a time + jumping from a group adding 2 letters)

hope i'm clear

>> No.6786906 [View]
File: 2.00 MB, 343x297, 1369259372131.gif [View same] [iqdb] [saucenao] [google]
6786906

1) is there an even or odd number of numbers to reorder?
2) is the number of 'number k' appearing even or odd?
3) if answers to 1) and 2) are both 'odd' then there's a 'k' in the middle
4) if answer to 2) is even then half of them will appear in the left side

>> No.6783794 [View]
File: 2.00 MB, 343x297, 1369259372131.gif [View same] [iqdb] [saucenao] [google]
6783794

>>6783758
there is a reasonably doable trick to get it. here's the hint (prove it):

>>6783772
why? you're right on a certain point of view, but roots can be complex... what makes you say there's no root?

>> No.6761779 [View]
File: 2.00 MB, 343x297, 1369259372131.gif [View same] [iqdb] [saucenao] [google]
6761779

For any integer k, prove that there is a polynomial <span class="math"> P_k [/spoiler] such that for all integer <span class="math">n, \sum_{i=0}^n i^k = P_k(n)[/spoiler]

>> No.6753875 [View]
File: 2.00 MB, 343x297, 1369259372131.gif [View same] [iqdb] [saucenao] [google]
6753875

>>6752637
>>6752515
>>6751672
>>6751416
>>6751019
>>6751019


i found proof of that, anyone want it?

>> No.4448774 [View]
File: 2.00 MB, 343x297, 1324085906118.gif [View same] [iqdb] [saucenao] [google]
4448774

I'd love me some:

F:\School\Chemistry\Chemistry - Organic\Organic Chemistry (Bruice).pdf

In return, I offer you cute little cats.

>> No.3956311 [View]
File: 2.00 MB, 343x297, 1319155870559.gif [View same] [iqdb] [saucenao] [google]
3956311

Bump.
Pic unrelated.

Navigation
View posts[+24][+48][+96]