20221015, 13:21  #34 
"James Heinrich"
May 2004
exNorthern Ontario
2×2,083 Posts 
You mean a flash drive. Or a microSD card inside a giant enclosure. Some of them are real, some of them are scams, but all of them are the same low reliability as any cheap flash drive.
Not at all to be confused with "real" SSDs that cost ~$100/TB. 
20221015, 14:00  #35  
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
5^{2}·7·67 Posts 
Quote:
Redundant information compresses very well, if the compression algorithm is any good. The alternative given for consideration doesn't compress at all  the compressed size is exactly the same as the uncompressed size. Accordingly, my answer is "redundant information". 

20221015, 14:15  #36  
Undefined
"The unspeakable one"
Jun 2006
My evil lair
1A3D_{16} Posts 
Quote:
Redundant information: X divided by Y; X, Y > 0 No information: X divided by Y; X, Y = 0 If I compute the two ratios using FDIV on my FPU, and then use FCMP to compare them, what result will I get? 

20221015, 15:58  #37  
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
11725_{10} Posts 
Quote:
When I implemented a FP instruction set back in the day, 0/0 yielded NaN (according to spec) and NaN was not comparable to any number, including itself (again according to spec). 

20221015, 15:59  #38  
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
5^{2}×7×67 Posts 
Quote:
I argue that my approach is more appropriate given that we are considering the storage space used in each case. 

20221015, 22:40  #39 
Undefined
"The unspeakable one"
Jun 2006
My evil lair
3×2,239 Posts 

20221016, 19:28  #40 
"Ed Hall"
Dec 2009
Adirondack Mtns
2^{3}×677 Posts 
Serious question:
Wouldn't a "simple" list of all the primes known to exist within all the sequences be sufficient to reproduce all the sequences? IOW, wouldn't a copy of the Last fiddled with by EdH on 20221016 at 19:40 Reason: I wanted to. 
20221016, 19:31  #41 
"Oliver"
Sep 2017
Porta Westfalica, DE
5A2_{16} Posts 
Yes, it would take some time, but I would assert it is a reasonable amount of time. You could "trial factor" each number by trying each prime known to FactorDB up to sqrt(number). I am thinking you could even improve that a lot by using some GCD trickery.

20221016, 19:34  #42  
"Robert Gerbicz"
Oct 2005
Hungary
655_{16} Posts 
Quote:


20221017, 05:31  #43  
"Alexander"
Nov 2008
The Alamo City
2×13×37 Posts 
Quote:
Quote:
See below. Quote:
Quote:


20221020, 09:28  #44  
Romulan Interpreter
"name field"
Jun 2011
Thailand
5·11^{2}·17 Posts 
Quote:
2. In which situation do you actually need to "go back"? (i.e. given 19, get 65 and 75 out of it) (idem) The "procedure", as I know it, is always in the opposite direction  you are giving 65, or 77, and need to get 19. Of course, to reconstruct the complete tree you need to be given BOTH 65 and 77, AND their factors (unless your name is sm88, see his related thread here around). Once you are given the factors of them, you can do this very easy (i.e. compute sigma, paint the trees). Sometimes ago I posted that the most of the sequences terminate in 43. Also, when somebody asked (I think it was Dubslow) I posted that the largest prime a (nottrivial, not like M82589933) sequence terminates into, was (about 20 digits number, I don't have it now). How did I get that? 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
seasonal or long term trends  kriesel  Cloud Computing  19  20210526 16:51 
Long term evidence of civilization.  xilman  Science & Technology  65  20210507 12:26 
Using long long's in Mingw with 32bit Windows XP  grandpascorpion  Programming  7  20091004 12:13 
I think it's gonna be a long, long time  panic  Hardware  9  20090911 05:11 
Longterm Primenet archive  delta_t  Data  3  20050825 00:31 