mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > enzocreti

Reply
 
Thread Tools
Old 2020-08-29, 19:33   #12
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

22×2,333 Posts
Lightbulb

Quote:
Originally Posted by LaurV View Post
Reply to that: (from the "don't turn it on, take it apart!" guy)
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.
Batalov is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
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

All times are UTC. The time now is 01:54.

Fri Mar 5 01:54:20 UTC 2021 up 91 days, 22:05, 0 users, load averages: 1.61, 1.60, 1.76

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.