![]() |
![]() |
#12 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
22×2,333 Posts |
![]()
Btw, solving this famous google aptitude test alone is fairly impossible (I mean the exact answer) - one has to have a very solid background (one can find a solution on the web, and no, it cannot be made easier). I can honestly say that I cannot simply sit and reproduce it (I can get it and then I forget it - need the RAM brain cells for other work). I like what the guy did. And as a practical computational scientist every one can find computational solution doing what he did, -- but in an ad hoc small program not with real resistors.
But everyone who wants to be ready for productive work in real world should know how to solve this for the nodes that a "king-move" apart, both adjacent and diagonal. It is very similar to the easier class of problems on https://projecteuler.net/ or in IBM Ponder This. |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
PRP CF type | ATH | PrimeNet | 9 | 2020-03-26 08:36 |
Algorithm for generating Carmichael numbers of type 1105 | devarajkandadai | Number Theory Discussion Group | 2 | 2020-02-02 06:12 |
Type of work to get? | ZFR | Information & Answers | 7 | 2011-09-17 08:43 |
Ram type | JuanTutors | Hardware | 4 | 2004-08-14 23:04 |
How long does factoring run on 2^33,xxx,xxx type numbers? | nukemyrman | Lounge | 11 | 2003-03-06 14:12 |