search for: oeis

The commit 874f76a "PL011: fix reverse logic for interrupt mask register" introduced regression on the Versatile Express. The board didn''t receive correctly input. The timeout interrupt may be asserted when the FIFO is not empty, and no futher data is received over a 32-bit period. Signed-off-by: Julien Grall <julien.grall@linaro.org> --- xen/drivers/char/pl011.c | 2

Hi, I am using RH 7.2 Enigma and with ext3 filesystem. Before installing RH Linux, I used Partition Magic 7 in Windows to prepare partition ext2 for Linux which was then converted to ext3 when installing RH 7.2. Now that I want to expand the space for the Linux partition, I find out that PM 7 does not support and recognize ext3 filesystem. My questions then are: 1. How do I convert ext3 to

On Tue 2015-05-26 12:57:05 -0400, Hubert Kario wrote: > creating composites that will pass even 100000 rounds of Miller-Rabin is > relatively simple.... > (assuming the values for M-R tests are picked randomly) Can you point me to the algorithms for doing that? This would suggest that we really do want primality proofs (and a good way to verify them). Do those algorithms hold for

I've just updated to a snapshot of 4.9-PRERELEASE. The usb/umass support seems *much* more stable than I found it with 4.8. My Oracom USB MP3 player now works without errors, and achieves up to 400KB/sec throughput. However, if I connect my Belkin CompactFlash reader instead, that's very, very slow indeed. The greatest data rate I see is about 4KB/sec, although no errors are

...-0400, Hubert Kario wrote: >> > creating composites that will pass even 100000 rounds of Miller-Rabin is >> > relatively simple.... >> > (assuming the values for M-R tests are picked randomly) >> >> Can you point me to the algorithms for doing that? > > OEIS A014233 Hm, this is a sequence, but not an algorithm. It looks to me like it is not exhaustive, just a list of those integers which are known to have the stated property ("Smallest odd number for which Miller-Rabin primality test on bases <= n-th prime does not reveal compositeness")...

Hi, I am trying to get different combinations of a vector of different size and find their sum. For example, if I have a vector (i,j) where i and j can be anything from 0 to 5, i get these combinations (0,0), (0,1), (1,0), (1,1), (2,0), ...... (5,5) and find sum of these as 0, 1, 1, 2, ..... , 10. I used outer functions to get this and it worked. What if I have a vector (i,j,k) where all i, j ,

On Wed 2015-05-27 05:23:41 -0400, Hubert Kario wrote: > On Tuesday 26 May 2015 15:10:01 Daniel Kahn Gillmor wrote: >> On Tue 2015-05-26 14:02:07 -0400, Hubert Kario wrote: >> > OEIS A014233 >> >> Hm, this is a sequence, but not an algorithm. It looks to me like it is >> not exhaustive, just a list of those integers which are known to have >> the stated property ("Smallest odd number for which Miller-Rabin >> primality test on bases <= n-...

net use * \\samba\mgerdts Debug level 10 says: [2001/06/22 10:28:49, 1, pid=29656] smbd/password.c:pass_check_smb(554) Couldn't find user 'mgerdts' in smb_passwd file. [2001/06/22 10:28:49, 2, pid=29656] smbd/reply.c:reply_sesssetup_and_X(951) NT Password did not match for user 'mgerdts'! [2001/06/22 10:28:49, 2, pid=29656] smbd/reply.c:reply_sesssetup_and_X(961)