Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.math > #527380 > unrolled thread
| Started by | Kcir <rick_s7777777@mail.com> |
|---|---|
| First post | 2021-07-02 12:14 -0700 |
| Last post | 2021-07-20 11:29 -0700 |
| Articles | 20 on this page of 106 — 5 participants |
Back to article view | Back to sci.math
A new math problem for everyone Kcir <rick_s7777777@mail.com> - 2021-07-02 12:14 -0700
Re: A new math problem for everyone Kcir <rick_s7777777@mail.com> - 2021-07-02 12:16 -0700
Re: A new math problem for everyone Kcir <rick_s7777777@mail.com> - 2021-07-02 12:55 -0700
Re: A new math problem for everyone bwr fml <qbwrfmlx@gmail.com> - 2021-07-02 13:07 -0700
Re: A new math problem for everyone Kcir <rick_s7777777@mail.com> - 2021-07-02 13:22 -0700
Re: A new math problem for everyone Kcir <rick_s7777777@mail.com> - 2021-07-02 13:26 -0700
Re: A new math problem for everyone - For the win you snooze you lose Kcir <rick_s7777777@mail.com> - 2021-07-02 13:38 -0700
Re: A new math problem for everyone - For the win you snooze you lose Kcir <rick_s7777777@mail.com> - 2021-07-02 13:56 -0700
Re: A new math problem for everyone - For the win you snooze you lose Kcir <rick_s7777777@mail.com> - 2021-07-02 14:07 -0700
Re: A new math problem for everyone - For the win you snooze you lose bwr fml <qbwrfmlx@gmail.com> - 2021-07-02 14:41 -0700
Re: A new math problem for everyone - For the win you snooze you lose Kcir <rick_s7777777@mail.com> - 2021-07-02 14:52 -0700
Re: A new math problem for everyone - For the win you snooze you lose Kcir <rick_s7777777@mail.com> - 2021-07-02 14:58 -0700
Re: A new math problem for everyone "mitchr...@gmail.com" <mitchrae3323@gmail.com> - 2021-07-02 15:06 -0700
Re: A new math problem for everyone Kcir <rick_s7777777@mail.com> - 2021-07-02 15:20 -0700
Re: A new math problem for everyone rcRC compression the proof Kcir <rick_s7777777@mail.com> - 2021-07-02 15:50 -0700
Re: A new math problem for everyone rcRC compression the proof Kcir <rick_s7777777@mail.com> - 2021-07-02 16:13 -0700
Re: A new math problem for everyone rcRC compression the proof Kcir <rick_s7777777@mail.com> - 2021-07-02 17:17 -0700
Re: A new math problem for everyone rcRC compression the proof Kcir <rick_s7777777@mail.com> - 2021-07-02 17:28 -0700
Re: A new math problem for everyone rcRC compression the proof "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-07-02 19:35 -0700
Re: A new math problem for everyone rcRC compression the proof Kcir <rick_s7777777@mail.com> - 2021-07-02 17:31 -0700
Re: A new math problem for everyone rcRC compression the proof Kcir <rick_s7777777@mail.com> - 2021-07-02 17:40 -0700
Re: A new math problem for everyone rcRC compression the proof "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-07-02 19:36 -0700
Re: A new math problem for everyone rcRC compression the proof "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-07-02 20:01 -0700
Re: A new math problem for everyone "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-07-02 17:14 -0700
Re: A new math problem for everyone "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-07-02 19:59 -0700
Re: A new math problem for everyone "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-07-02 20:02 -0700
Re: A new math problem for everyone Kcir <rick_s7777777@mail.com> - 2021-07-02 20:14 -0700
Re: A new math problem for everyone Kcir <rick_s7777777@mail.com> - 2021-07-02 20:40 -0700
Re: A new math problem for everyone Kcir <rick_s7777777@mail.com> - 2021-07-02 20:54 -0700
Re: A new math problem for everyone Kcir <rick_s7777777@mail.com> - 2021-07-02 21:15 -0700
Re: A new math problem for everyone Kcir <rick_s7777777@mail.com> - 2021-07-02 21:43 -0700
Re: A new math problem for everyone "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-07-02 21:58 -0700
Re: A new math problem for everyone Kcir <rick_s7777777@mail.com> - 2021-07-02 22:00 -0700
Re: A new math problem for everyone Kcir <rick_s7777777@mail.com> - 2021-07-02 22:20 -0700
Re: A new math problem for everyone "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-07-02 22:23 -0700
Re: A new math problem for everyone - easy long division - we have reached the promised land. Kcir <rick_s7777777@mail.com> - 2021-07-03 14:06 -0700
Re: A new math problem for everyone - easy long division - we have reached the promised land. Kcir <rick_s7777777@mail.com> - 2021-07-03 14:44 -0700
Re: A new math problem for everyone - easy long division - we have reached the promised land. Kcir <rick_s7777777@mail.com> - 2021-07-03 14:59 -0700
Re: A new math problem for everyone - easy long division - we have reached the promised land. Kcir <rick_s7777777@mail.com> - 2021-07-03 15:18 -0700
Re: A new math problem for everyone - easy long division - we have reached the promised land. Kcir <rick_s7777777@mail.com> - 2021-07-03 15:35 -0700
Re: A new math problem for everyone - easy long division - we have reached the promised land. Kcir <rick_s7777777@mail.com> - 2021-07-03 15:48 -0700
Re: A new math problem for everyone - easy long division - we have reached the promised land. Kcir <rick_s7777777@mail.com> - 2021-07-03 15:51 -0700
Re: A new math problem for everyone - easy long division - we have reached the promised land. Kcir <rick_s7777777@mail.com> - 2021-07-03 15:54 -0700
Re: A new math problem for everyone - easy long division - we have reached the promised land. Kcir <rick_s7777777@mail.com> - 2021-07-03 15:59 -0700
Re: A new math problem for everyone - easy long division - we have reached the promised land. Kcir <rick_s7777777@mail.com> - 2021-07-03 16:11 -0700
Re: A new math problem for everyone - easy long division - we have reached the promised land. "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-07-03 16:13 -0700
Re: A new math problem for everyone - easy long division - we have reached the promised land. Kcir <rick_s7777777@mail.com> - 2021-07-03 16:19 -0700
Re: A new math problem for everyone - regarding outside photo and the usb drive Kcir <rick_s7777777@mail.com> - 2021-07-04 00:15 -0700
Re: A new math problem for everyone - screenshots Kcir <rick_s7777777@mail.com> - 2021-07-04 03:04 -0700
Re: A new math problem for everyone - more screenshots random numbers Kcir <rick_s7777777@mail.com> - 2021-07-04 03:35 -0700
Re: A new math problem for everyone - more screenshots random numbers - larger Kcir <rick_s7777777@mail.com> - 2021-07-04 04:27 -0700
Re: A new math problem for everyone - more screenshots random numbers - larger Kcir <rick_s7777777@mail.com> - 2021-07-04 04:34 -0700
Re: A new math problem for everyone - more screenshots random numbers - larger Kcir <rick_s7777777@mail.com> - 2021-07-04 04:39 -0700
Re: A new math problem for everyone - more screenshots random numbers - larger Kcir <rick_s7777777@mail.com> - 2021-07-04 04:57 -0700
Re: math problem - The law of diminishing returns Kcir <rick_s7777777@mail.com> - 2021-07-04 19:16 -0700
Re: math problem - The law of diminishing returns Kcir <rick_s7777777@mail.com> - 2021-07-04 19:29 -0700
Re: math problem - The law of diminishing returns Kcir <rick_s7777777@mail.com> - 2021-07-05 11:10 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Kcir <rick_s7777777@mail.com> - 2021-07-07 23:05 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Kcir <rick_s7777777@mail.com> - 2021-07-07 23:29 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size bwr fml <qbwrfmlx@gmail.com> - 2021-07-08 01:13 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Kcir <rick_s7777777@mail.com> - 2021-07-08 01:34 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Kcir <rick_s7777777@mail.com> - 2021-07-08 02:02 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Kcir <rick_s7777777@mail.com> - 2021-07-08 02:46 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size bwr fml <qbwrfmlx@gmail.com> - 2021-07-08 02:47 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Kcir <rick_s7777777@mail.com> - 2021-07-08 03:01 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Kcir <rick_s7777777@mail.com> - 2021-07-08 03:16 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Daniel Pehoushek <pehoushek1@gmail.com> - 2021-07-08 03:30 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Kcir <rick_s7777777@mail.com> - 2021-07-08 03:30 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size bwr fml <qbwrfmlx@gmail.com> - 2021-07-08 03:41 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Kcir <rick_s7777777@mail.com> - 2021-07-08 03:45 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Kcir <rick_s7777777@mail.com> - 2021-07-08 04:27 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Kcir <rick_s7777777@mail.com> - 2021-07-08 07:46 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Kcir <rick_s7777777@mail.com> - 2021-07-08 08:02 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Kcir <rick_s7777777@mail.com> - 2021-07-08 10:42 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size Kcir <rick_s7777777@mail.com> - 2021-07-08 00:40 -0700
Re: math problem - if Kcir <rick_s7777777@mail.com> - 2021-07-08 01:20 -0700
Re: math problem - Did a test shrunk a 8MB rar down to 1.75 percent of its original size "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-07-08 14:24 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-19 22:55 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-19 23:08 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-19 23:30 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 00:03 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 00:24 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 00:59 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 01:17 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 01:31 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 01:42 -0700
Re: math problem random number theory bwr fml <qbwrfmlx@gmail.com> - 2021-07-20 01:47 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 02:10 -0700
Re: math problem random number theory - The chicken and the egg Kcir <rick_s7777777@mail.com> - 2021-07-20 03:07 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 03:31 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 05:32 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 07:31 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 07:51 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 07:54 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 08:01 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 08:12 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 08:12 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 08:24 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 08:46 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 09:04 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 09:35 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 10:18 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 10:29 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 10:54 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 11:10 -0700
Re: math problem random number theory Kcir <rick_s7777777@mail.com> - 2021-07-20 11:29 -0700
Page 2 of 6 — ← Prev page 1 [2] 3 4 5 6 Next page →
| From | Kcir <rick_s7777777@mail.com> |
|---|---|
| Date | 2021-07-02 17:40 -0700 |
| Subject | Re: A new math problem for everyone rcRC compression the proof |
| Message-ID | <cd26535c-6e43-4999-8f5d-23577661a7dfn@googlegroups.com> |
| In reply to | #527441 |
So if we are only doing div 2 and minus 1 then our code will look like aaaaabaababaaaaabaaababababaaa where b represents -1 For the win. And I will write the program later and compress that for you using a chain reaction.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-07-02 19:36 -0700 |
| Subject | Re: A new math problem for everyone rcRC compression the proof |
| Message-ID | <sboig9$1hn8$2@gioia.aioe.org> |
| In reply to | #527441 |
On 7/2/2021 5:31 PM, Kcir wrote: > Kcir's profile photo > Kcir > unread, > 5:28 PM (now) > to > -0.70928383564905214400491843078452104082710295997209875060333681255435334699521962691343068404279561138607296289815362070140579962 > > So then to compress that number well that is not a file so it starts with a decimal. And it is a negative number. Well, this number can be stored as a file, then we can create a number using its hexbytes, or whatever encoding you desire. > > So we would need rules in our new program to identify the number to first turn it into a whole number. > Then lastly we would add the sign and the decimal place by writing an instruction that would appear as a symbol. > > So firstly to write this program you want to write a method of doing the math. > And I am suggesting you do it as you do it by hand with a pencil. > So working from the right to the left through your number. > When you decompress it and start your chain reaction to recreate the number you will need to multiply by 2 every time you see an 'a'. > So you would want to have lots of RAM. > > With this number it will easily and quickly write a small file each pass if you wanted. > So here that number can go into a file, then do the math in columns, div 2 and minus the last digit by 1 if it is an odd number and not an even number. >
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-07-02 20:01 -0700 |
| Subject | Re: A new math problem for everyone rcRC compression the proof |
| Message-ID | <sbojum$1ve8$2@gioia.aioe.org> |
| In reply to | #527457 |
On 7/2/2021 7:36 PM, Chris M. Thomasson wrote: > On 7/2/2021 5:31 PM, Kcir wrote: >> Kcir's profile photo >> Kcir >> unread, >> 5:28 PM (now) >> to >> -0.70928383564905214400491843078452104082710295997209875060333681255435334699521962691343068404279561138607296289815362070140579962 >> >> >> So then to compress that number well that is not a file so it starts >> with a decimal. And it is a negative number. > > Well, this number can be stored as a file, then we can create a number > using its hexbytes, or whatever encoding you desire. > >> >> So we would need rules in our new program to identify the number to >> first turn it into a whole number. >> Then lastly we would add the sign and the decimal place by writing an >> instruction that would appear as a symbol. >> >> So firstly to write this program you want to write a method of doing >> the math. >> And I am suggesting you do it as you do it by hand with a pencil. >> So working from the right to the left through your number. >> When you decompress it and start your chain reaction to recreate the >> number you will need to multiply by 2 every time you see an 'a'. >> So you would want to have lots of RAM. >> >> With this number it will easily and quickly write a small file each >> pass if you wanted. >> So here that number can go into a file, then do the math in columns, >> div 2 and minus the last digit by 1 if it is an odd number and not an >> even number. >> > Some more info about my HMAC cipher: http://funwithfractals.atspace.cc/ct_cipher/
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-07-02 17:14 -0700 |
| Message-ID | <sboa4o$10u2$1@gioia.aioe.org> |
| In reply to | #527380 |
On 7/2/2021 12:14 PM, Kcir wrote: > So if we say a zipped program we want to send is a stream of numbers but one large number, how can we compress it if it is already compressed? So then add 3 zeros to its length as a large number using power of 10 so as an example 1,000 it has to have a 1 and all zeros, 10 to the power of 40 million as an example, now divide the large number into that and use exponential notation every time you make your large number or refer to it. As you create your formula that will recreate that large number as its result or answer. > > So this is a fun math project for math hungry people. > > Hint? Adjust the number as part of the formula so that it falls into an algorithmic pattern that can use exponential notation. All theory at this point. > Have fun and spread this puzzle to your friends. > > I inwented it, I am the Rickest Rick of all the Ricks if anyone wants to know who inwented it. > Here is a little toy experimental program I made for fun that stores data in complex numbers using a Julia set. It can generate some huge numbers, but they are floating point. http://fractallife247.com/test/rifc_cipher For instance, the following complex number encodes my name: real: -0.70928383564905214400491843078452104082710295997209875060333681255435334699521962691343068404279561138607296289815362070140579962 imag: 0.75006448767684071252250159734912475298989657994192333528788266765351648099327204708007723341215421128937413101480606378377592858 ;^) This just for fun. Can you compress that complex number?
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-07-02 19:59 -0700 |
| Message-ID | <sbojq0$1ve8$1@gioia.aioe.org> |
| In reply to | #527380 |
On 7/2/2021 12:14 PM, Kcir wrote: > So if we say a zipped program we want to send is a stream of numbers but one large number, how can we compress it if it is already compressed? So then add 3 zeros to its length as a large number using power of 10 so as an example 1,000 it has to have a 1 and all zeros, 10 to the power of 40 million as an example, now divide the large number into that and use exponential notation every time you make your large number or refer to it. As you create your formula that will recreate that large number as its result or answer. > > So this is a fun math project for math hungry people. > > Hint? Adjust the number as part of the formula so that it falls into an algorithmic pattern that can use exponential notation. All theory at this point. > Have fun and spread this puzzle to your friends. > > I inwented it, I am the Rickest Rick of all the Ricks if anyone wants to know who inwented it. > Here is an encryption in hexbytes of my name using my HMAC cipher: http://fractallife247.com/test/hmac_cipher/ver_0_0_0_1/ with the default key: 17b7fbaed7cfc97f9641c3e7a0730456dfe136caa14dc182f5619755d40b65b7bf6263b1916aee7da6a385a6b627c8ec12a2a5a373cc97d2e42662753aca401e3ad6a997fb4f93836b48af37f349fce2e08a22c2d5bad411930899b623697b6eb8ea79c0dddfcd44d42af398d7069806ff5f6caa Here is a link that automatically goes to my site, puts in the hexbytes and decrypts the message as a pure convenience. Keep in mind that this message was encrypted using the default key: http://fractallife247.com/test/hmac_cipher/ver_0_0_0_1?ct_hmac_cipher=17b7fbaed7cfc97f9641c3e7a0730456dfe136caa14dc182f5619755d40b65b7bf6263b1916aee7da6a385a6b627c8ec12a2a5a373cc97d2e42662753aca401e3ad6a997fb4f93836b48af37f349fce2e08a22c2d5bad411930899b623697b6eb8ea79c0dddfcd44d42af398d7069806ff5f6caa The hexbytes can be stored in a raw file quite easily using 8-bit unsigned integers. I use hexbytes in order to be able to send a binary message as text across the internet. Thats the only reason.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-07-02 20:02 -0700 |
| Message-ID | <sbok07$1ve8$3@gioia.aioe.org> |
| In reply to | #527380 |
On 7/2/2021 12:14 PM, Kcir wrote: > So if we say a zipped program we want to send is a stream of numbers but one large number, how can we compress it if it is already compressed? So then add 3 zeros to its length as a large number using power of 10 so as an example 1,000 it has to have a 1 and all zeros, 10 to the power of 40 million as an example, now divide the large number into that and use exponential notation every time you make your large number or refer to it. As you create your formula that will recreate that large number as its result or answer. > > So this is a fun math project for math hungry people. > > Hint? Adjust the number as part of the formula so that it falls into an algorithmic pattern that can use exponential notation. All theory at this point. > Have fun and spread this puzzle to your friends. > > I inwented it, I am the Rickest Rick of all the Ricks if anyone wants to know who inwented it. > Are you familiar with arithmetic encoding: https://en.wikipedia.org/wiki/Arithmetic_coding ?
[toc] | [prev] | [next] | [standalone]
| From | Kcir <rick_s7777777@mail.com> |
|---|---|
| Date | 2021-07-02 20:14 -0700 |
| Message-ID | <c07467bb-9680-4e66-a637-2005f3189b6an@googlegroups.com> |
| In reply to | #527460 |
On Friday, July 2, 2021 at 8:02:41 PM UTC-7, Chris M. Thomasson wrote: > On 7/2/2021 12:14 PM, Kcir wrote: > > So if we say a zipped program we want to send is a stream of numbers but one large number, how can we compress it if it is already compressed? So then add 3 zeros to its length as a large number using power of 10 so as an example 1,000 it has to have a 1 and all zeros, 10 to the power of 40 million as an example, now divide the large number into that and use exponential notation every time you make your large number or refer to it. As you create your formula that will recreate that large number as its result or answer. > > > > So this is a fun math project for math hungry people. > > > > Hint? Adjust the number as part of the formula so that it falls into an algorithmic pattern that can use exponential notation. All theory at this point. > > Have fun and spread this puzzle to your friends. > > > > I inwented it, I am the Rickest Rick of all the Ricks if anyone wants to know who inwented it. > > > Are you familiar with arithmetic encoding: > > https://en.wikipedia.org/wiki/Arithmetic_coding > > ? Totally in fact have my own encryption you take a photo outside /7 * 3 +8 or any scramble you want until it cannot be recognized as a photo on disk, then you merely add or subtract or multiply or divide your data stream number for number. and then at the other end they just need that photo which could be only important to you and one of a thousand on your harddrive. You can make a black box modem with a matching one photo in each and then self destruct with magnesium if the container is breached.
[toc] | [prev] | [next] | [standalone]
| From | Kcir <rick_s7777777@mail.com> |
|---|---|
| Date | 2021-07-02 20:40 -0700 |
| Message-ID | <77840d2c-7f83-429f-b67f-02dd75faa728n@googlegroups.com> |
| In reply to | #527461 |
> > Are you familiar with arithmetic encoding: > > > > https://en.wikipedia.org/wiki/Arithmetic_coding > > > Totally in fact have my own encryption you take a photo outside /7 * 3 +8 or any scramble you want until it cannot be recognized as a photo on disk, then you merely add or subtract or multiply or divide your data stream number for number. and then at the other end they just need that photo which could be only important to you and one of a thousand on your harddrive. > > You can make a black box modem with a matching one photo in each and then self destruct with magnesium if the container is breached. So a server sends your phone a photo and it says this is your key. And then you download a stream of data and you decode it as it comes in using your photo as a key. Now where you put your photo will depend on how safe your data transfer is. So you should put it on a small stick like a USB drive and then only plug that in when the software needs your photo. Then remove the drive and it can instruct you to do that. So if it was gov they might hand deliver the USB drives that have the photo on it. So now at both ends the stamps are secure on usb drives the evidence is removed to protect from hacking. However it will not stop spying. So an admin would rotate the formulas for scrambling the images by entering their photo to mix it up and everyone gets a different outside image. So each method is unique since any photo taken outside is unique providing you photograph a multi colored scene or garden etc. No supercomputer or quantum computer could guess that photo. If it popped a billion photos it made itself no one would be there to say that must be it. And you couldn't try them all simply because the formula to scramble them first keeps changing. According to the primes and the Reimann hypothesis. Or similar by the time an academic is finished with it. But regarding the theory to reverse engineer a large number as if it were a biological end process, so you add 6 zeros to the w in this case w=1000000000000 x=123456000 So we added 6 zeroes to w and we will just use exponential notation there when the time comes to say what number that is. w=10 ^12 it could easily be 10^690m (m for million) So here we have a remainder when we try to find a small divisor but we slough that off with the extra zeros. w=1000000000000 x=123456000 w/x=8100.051840331778 We have right there reduced 6 digits to 4 digits. w/8100 =123456790.1234568 and all we want are the original 6 digits which are accurate.
[toc] | [prev] | [next] | [standalone]
| From | Kcir <rick_s7777777@mail.com> |
|---|---|
| Date | 2021-07-02 20:54 -0700 |
| Message-ID | <4824eff5-b350-4f2e-850d-06bf0b3c3f0dn@googlegroups.com> |
| In reply to | #527462 |
Ok so closing in on using this with large numbers. x=1234567898765432 (16 digits) w=10000000000000000000000 (22 zeroes so we want x to be 6 short ) we factor up x to ditch the end of the code in micro biology believe it or not they don;t terminate a string some times they just repeat a bit of code and that sometimes creates a problem. Huntingtons Chorea. Huntington's disease (HD), also known as Huntington's chorea, is a neurodegenerative disease that is mostly inherited. The earliest symptoms are often subtle problems with mood or mental abilities. A general lack of coordination and an unsteady gait often follow. In people with Huntington disease, the CAG segment is repeated 36 to more than 120 times. People with 36 to 39 CAG repeats may or may not develop the signs and symptoms of Huntington disease, while people with 40 or more repeats almost always develop the disorder. A sad situation for those who discover they have this incurable disease. So the math anyway is consistent with the idea that their may be remainders and they may not affect the process or they may. So in our case where we are looking at a zip file 40mb and we are looking at that stretched out data as a large number. We are going to create an exponential notation and say 10 to the power of 40m or similar then we are going to add 6 zeroes. so 40m plus 6 That will always be the case so the program would know that and then you are going to add 3 zeroes to x and then divide x into w and you will get a small number dude. yippee ei o ki yay Eureka.
[toc] | [prev] | [next] | [standalone]
| From | Kcir <rick_s7777777@mail.com> |
|---|---|
| Date | 2021-07-02 21:15 -0700 |
| Message-ID | <a3bb5aa5-391f-4ac7-bdd7-712143adeae4n@googlegroups.com> |
| In reply to | #527463 |
Yes if it was gov admin that wanted to encrypt a file and send it to a home worker, they have a USB device and on there a picture of you outside with your name on the picture. So then on her USB drive she has all the staff pictures and their names in similar fashion. So when she sends you a file then you use your photo to decrypt it that you keep on your usb drive. So admin needs to know who they are sending it to and then it is completely secure and hack proof. They can intercept the data but they would never be able to separate the data from the photo. So every transmission since the data changes the transmission changes. If they try to match up portions to decrypt a portion of the file if you are sending repetitive data they would still be nowhere. So these bits are the same these bits are still meaningless.
[toc] | [prev] | [next] | [standalone]
| From | Kcir <rick_s7777777@mail.com> |
|---|---|
| Date | 2021-07-02 21:43 -0700 |
| Message-ID | <dd7f1ec4-8514-465c-8b76-c961d050ad45n@googlegroups.com> |
| In reply to | #527466 |
On Friday, July 2, 2021 at 9:15:42 PM UTC-7, Kcir wrote: > Yes if it was gov admin that wanted to encrypt a file and send it to a home worker, they have a USB device and on there a picture of you outside with your name on the picture. > So then on her USB drive she has all the staff pictures and their names in similar fashion. > So when she sends you a file then you use your photo to decrypt it that you keep on your usb drive. > > So admin needs to know who they are sending it to and then it is completely secure and hack proof. > They can intercept the data but they would never be able to separate the data from the photo. > So every transmission since the data changes the transmission changes. > > If they try to match up portions to decrypt a portion of the file if you are sending repetitive data they would still be nowhere. > > So these bits are the same these bits are still meaningless. Here is some code 4032 x 3024 photo name of function variables i,j,k,l:integer; For j:= 0 to 3024-1 do for i:=0 to 4032-1 do read byte from disk, add byte from photo write sum to disk. If you still have data and you have reached the end of your photo pixel values which are 3 numbers 0 to 255 red blue green so you are adding the red value then the blue value then the green value like that to the data stream and saving the result in the same linear fashion. so you say if not end of file (your data file) then start the pic over and repeat it. So you want to return a function call so you can just call that function over and over and trigger it off if a boolean switch is flipped then break your iteration code and be sure to check for activity like process messages if you are using WIndoze. So you can interrupt it if need be or else it might be going through there and ignoring you. So function dothethang(on:boolean):boolean; So here we just installed two switches, one that inside the brackets and one that is what the function returns true or false. It could return a number also. So when you call that function it will take the last point in the data and go from there but only if you add a variable that keep tracks of that. So then you need function dothethang(on:boolean;fnum:double):boolean; The biggest/largest integer that can be stored in a double without losing precision is the same as the largest possible value of a double. That is, DBL_MAX or approximately 1.8 × 10 ^308 (if your double is an IEEE 754 64-bit double). So you know where you are in the file and each time you save a byte you want to increment where you are in the file so you are moving through the bytes and can repeat the photo from the beginning and just keep motoring through that file. As long as at the other end they merely reverse the process. So now you have changed every number your double or your integer or your word by changing the data by adding a red color value a green color value and a blue color value as you motor through the data. Now you need to first scramble the image or else any 0 value will show the image when you add zero. So first you apply three steps like div 7 times 3 plus 8 and now to each pixel and it now is white noise only colored white noise. So if you add a zero from your data it will still look like colored noise. So the software prompts for your USB says please insert your usb, you do it takes the photo scrambles it and then processes the data and the sends the data. It says please remove your usb drive. At the other end it says please insert your usb drive. It gets your photo and so then it knows that it has been scrambled and so it does that and now it subtracts that from the data stream. Then it asks you to please remove your usb drive. Simple as that.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-07-02 21:58 -0700 |
| Message-ID | <sboqpl$1pof$1@gioia.aioe.org> |
| In reply to | #527470 |
On 7/2/2021 9:43 PM, Kcir wrote: > On Friday, July 2, 2021 at 9:15:42 PM UTC-7, Kcir wrote: >> Yes if it was gov admin that wanted to encrypt a file and send it to a home worker, they have a USB device and on there a picture of you outside with your name on the picture. >> So then on her USB drive she has all the staff pictures and their names in similar fashion. >> So when she sends you a file then you use your photo to decrypt it that you keep on your usb drive. >> >> So admin needs to know who they are sending it to and then it is completely secure and hack proof. >> They can intercept the data but they would never be able to separate the data from the photo. >> So every transmission since the data changes the transmission changes. >> >> If they try to match up portions to decrypt a portion of the file if you are sending repetitive data they would still be nowhere. >> >> So these bits are the same these bits are still meaningless. > > Here is some code > > 4032 x 3024 photo > > name of function > variables > i,j,k,l:integer; > > For j:= 0 to 3024-1 do > for i:=0 to 4032-1 do > read byte from disk, add byte from photo write sum to disk. > > If you still have data and you have reached the end of your photo pixel values which are 3 numbers 0 to 255 > red blue green so you are adding the red value then the blue value then the green value like that to the data stream and saving the result in the same linear fashion. > > so you say if not end of file (your data file) then start the pic over and repeat it. > So you want to return a function call so you can just call that function over and over and trigger it off if a boolean switch is flipped then break your iteration code and be sure to check for activity like process messages if you are using WIndoze. > So you can interrupt it if need be or else it might be going through there and ignoring you. > > So function dothethang(on:boolean):boolean; > > So here we just installed two switches, one that inside the brackets and one that is what the function returns true or false. > It could return a number also. > > So when you call that function it will take the last point in the data and go from there but only if you add a variable that keep tracks of that. > > So then you need > function dothethang(on:boolean;fnum:double):boolean; > > The biggest/largest integer that can be stored in a double without losing precision is the same as the largest possible value of a double. That is, DBL_MAX or approximately 1.8 × 10 ^308 (if your double is an IEEE 754 64-bit double). > > So you know where you are in the file and each time you save a byte you want to increment where you are in the file so you are > moving through the bytes and can repeat the photo from the beginning and just keep motoring through that file. > > As long as at the other end they merely reverse the process. > > So now you have changed every number your double or your integer or your word by changing the data by adding a red color value a green color value and a blue color value as you motor through the data. Now you need to first scramble the image or else any 0 value will show the image when you add zero. > > So first you apply three steps like div 7 times 3 plus 8 and now to each pixel and it now is white noise only colored white noise. > So if you add a zero from your data it will still look like colored noise. > > So the software prompts for your USB says please insert your usb, you do it takes the photo scrambles it and then processes the data and the sends the data. It says please remove your usb drive. > At the other end it says please insert your usb drive. > It gets your photo and so then it knows that it has been scrambled and so it does that and now it subtracts that from the data stream. > Then it asks you to please remove your usb drive. > > Simple as that. > Please, post this over in sci.crypt!
[toc] | [prev] | [next] | [standalone]
| From | Kcir <rick_s7777777@mail.com> |
|---|---|
| Date | 2021-07-02 22:00 -0700 |
| Message-ID | <bb256d3f-ecfc-4de8-8977-3329c7d4c91bn@googlegroups.com> |
| In reply to | #527470 |
So different programmers do things differently. But you could calculate 4032 x 3024 = t; So then what size is your file? So file size div t so you know how many times you need to repeat the image. You don't want to use a while statement since that sometimes gets screwed by Windows and it just decides to skip that. And leave you hanging. So you want to always give it a number of iterations. Don't rely on Windows to say oh you reached infinity? so fsize/t = num and so then for k:= 0 to num -1 do dothethang(on,0); So you are telling it to only do it as many times as are needed since you know how many times it will repeat. Its not an unknown so don't be lazy do the math.
[toc] | [prev] | [next] | [standalone]
| From | Kcir <rick_s7777777@mail.com> |
|---|---|
| Date | 2021-07-02 22:20 -0700 |
| Message-ID | <1d59be32-7db1-470d-9342-e6536f8071a0n@googlegroups.com> |
| In reply to | #527472 |
Sorry but Friday and I am late picking up my girlfriends. So use any of it you want and may the force be with you! Publish or perish!
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-07-02 22:23 -0700 |
| Message-ID | <sbos8s$7gv$1@gioia.aioe.org> |
| In reply to | #527473 |
On 7/2/2021 10:20 PM, Kcir wrote: > Sorry but Friday and I am late picking up my girlfriends. > > So use any of it you want and may the force be with you! > Publish or perish! > https://youtu.be/7YvAYIJSSZY?list=RDMM
[toc] | [prev] | [next] | [standalone]
| From | Kcir <rick_s7777777@mail.com> |
|---|---|
| Date | 2021-07-03 14:06 -0700 |
| Subject | Re: A new math problem for everyone - easy long division - we have reached the promised land. |
| Message-ID | <061c85b8-8965-4be1-aa6f-b326d6297409n@googlegroups.com> |
| In reply to | #527474 |
For the win 1234567898765432123456789 That's a bitch of a number to divide in your head into 1 million quadrillion or something. And if we intend to take numbers with 40 million digits and divide them into numbers with 40 million and 3 digits. So do this and see how fast and easy it is so you can do this in your head no seriously in your frickin head. notice it is an odd number so we will use a formula and when we are done, our little algebra formula is going to result in that large number in all it's glory so that to send and entire 40mb program through a network, you will go oh that here you go. a*b=c+d=e. WTF??? Easy as pie first remove one so it is an even number. minus 1 1234567898765432123456788 div2 do that in your head you are a genius easy to do. see? Now keep doing it and doing your minus 1 and list your operations then what do you have? think about this. How may of those div 2 can you group into a div 6 or a div 8? then your remainder. You have to write a computer program since no other way exists to deal with very large numbers yet, but people have written programs but we can make our own and maybe improve on them. Like I know by looking at that number the first 4 digits that if I want to divide that into 40mb 1 and 40m zeroes the first 4 digits are the most important. The rest aren't going to do much if the number you divide into has 3 more zeros on the end of it. Which means your answer is going to have 3 or 4 digits. And then one hell of a lot of decimal places. 81.02 So we multiply that by 81.02 to see what we get. Our calculator in Windows can't use a number that large as above it only got to 2 7 digits short but those aren't important right now. 1.000246911579753e+17 So with 81.02 we managed to gt 3 clear digits. We got rid of the large numbers and our remainder is still a gazillion digits long. Our program could try to eliminate more digits sequentially. But I am thinking the minus one div 2 formula is going to shrink that number substantially so yeah how many times would you have to multiply a number by 2 to get close? Factors or two. So you start your computer rolling and you say compare the result to this large number but that is going to take too long. So the way to approach it is to use maybe 4 digits at a time on the left and work with remainders as separate operations in a chain reaction formula.
[toc] | [prev] | [next] | [standalone]
| From | Kcir <rick_s7777777@mail.com> |
|---|---|
| Date | 2021-07-03 14:44 -0700 |
| Subject | Re: A new math problem for everyone - easy long division - we have reached the promised land. |
| Message-ID | <568b79f9-dde8-475d-817e-66edebed8a6cn@googlegroups.com> |
| In reply to | #527565 |
What is my point? Well this number we can use a short form notation easily. 1000000000000000000000000000000000000000000000000000000000000000000000000000000000 right? And that can go on for 40 million digits. And we can still say 40mb and that is exact, precise and the actual value not an approximation. Now what is going to happen if I divide that number by 81.02? I am going to get an approximation of my program data stream large number which is random. So you need to instead build a chain reaction that will get you to that number using times two. You want a short form notation using times 2 that will remove most of those digits. Will that imitate all those values in those digits since they must all be exact you see. Its a wonderful puzzle and so much else has been done so that is why I am having some fun with it.
[toc] | [prev] | [next] | [standalone]
| From | Kcir <rick_s7777777@mail.com> |
|---|---|
| Date | 2021-07-03 14:59 -0700 |
| Subject | Re: A new math problem for everyone - easy long division - we have reached the promised land. |
| Message-ID | <3dddc762-9c16-437c-a301-e0b49cea1ecfn@googlegroups.com> |
| In reply to | #527566 |
Well there are things we can try and approaches we can take. We could look at the number we want to divide into 1000 and say is it less than half that or more than half that and use calculus ideas to find the middle so you are close to it. Get its rough boundaries does that remove digits though? So your only solution is to get zeroes in a row from the left and reduce the digits. You might end up with an algebra expression with a million brackets but 1 mb is still substantially smaller than 40mb. Pure math pure science and using computer programming so you don't have to write that algebra expression and do it in your head. So will chain results and not use brackets and write instructions on the fly as part of our compressing the data. And it is not so much for compressing the data. It is to learn about going the other way. Growth and these types of systems in DNA go the other way. But we can;t tell where they are going yet. We see it here and something change over there. In the brain usually. We don't know what it does between A and B quite often so we don't know the result of tampering with A until we see what it does to B. The problem there is the slow reaction time of B and what else has moved or changed.
[toc] | [prev] | [next] | [standalone]
| From | Kcir <rick_s7777777@mail.com> |
|---|---|
| Date | 2021-07-03 15:18 -0700 |
| Subject | Re: A new math problem for everyone - easy long division - we have reached the promised land. |
| Message-ID | <0b1ddd8e-900f-443c-9b3a-a34b6acaa592n@googlegroups.com> |
| In reply to | #527568 |
Growth and cell division and DNA replication is using 2 all the time so we should also use 2. So if we look at our zip file as a stretch of 40m random numbers and we want to use a formula using 2 to recreate that number. So if we divide it by 2 that helps a lot right? That lops off half the digits right? Sadly no it does not change the number of digits except for one if you are lucky. And slowly by slowly once you have a list of OPERATIONS that amount to half those digits then you have gone through one pass of the data. However maybe we can establish a pattern for those 20 digits of our formula. Or maybe try a different approach. Try multiplication and start with 2. So you can start with a short form that is roughly that number. If it is 40m digits long then 40 million digits Plus a zero and the number starting with a 1 is an easy immediate approximation. Running left to right are there any zeros does it matter if there are so that some numbers match up? It all matters from left to right and things carry and numbers change, so you almost need to be God to be able to write a short formula that will give you an answer with 40m random digits. But, it can be done. How short maybe doesn't matter as long as it is shortish.
[toc] | [prev] | [next] | [standalone]
| From | Kcir <rick_s7777777@mail.com> |
|---|---|
| Date | 2021-07-03 15:35 -0700 |
| Subject | Re: A new math problem for everyone - easy long division - we have reached the promised land. |
| Message-ID | <b9887cd0-b0bb-4516-8b5e-c3b968b02fa2n@googlegroups.com> |
| In reply to | #527569 |
Perhaps the best we can do is assign a to mean div 2 and assign b to mean minus 1. So then our formula when it can divide equally in 2 then that's an a, when it can't that's a b. aaababaaabaaababaaababaabaa So then if we right that a3aa3a3aa3aa2a2 We are assuming that if you do 3 div 2 in a row you will need to do the minus 1 according to our shorter notation. We can search for strings now and say every pattern we see like so a3aa3a3aa3 we will call C. Now that translates to Caa2a2 Yes of course for the win the Nobel prize for both math and literature. I can't believe like 5 days ago, that professor was awarded for his proof of the Reimann Hypothesis. 161 years people in large numbers worked on that problem. I was also alive when someone solved Fermat's Last Theorem proof. When we all get together and share ideas miracles can happen.
[toc] | [prev] | [next] | [standalone]
Page 2 of 6 — ← Prev page 1 [2] 3 4 5 6 Next page →
Back to top | Article view | sci.math
csiph-web