Search Results

Search found 578 results on 24 pages for 'prime studios'.

Page 6/24 | < Previous Page | 2 3 4 5 6 7 8 9 10 11 12 13  | Next Page >

• ASM programming, how to use loop?

  - by chris

  Hello. Im first time here.I am a college student. I've created a simple program by using assembly language. And im wondering if i can use loop method to run it almost samething as what it does below the program i posted. and im also eager to find someome who i can talk through MSN messanger so i can ask you questions right away.(if possible) ok…

  Read the article

• Reversing a for loop... want to print numbers in reverse

  - by user69514

  How would I change this loop to print prime number in reverse... starting from the biggest one first int main(){ bool prime; for( int i=3; i<=10000; i++){ prime = true; for(int n=2; n<=i-1; n++){ if( i%n == 0){ prime = false; } } if(prime){ cout…

  Read the article

• Strange output produced by program

  - by Boom_mooB

  I think that my code works. However, it outputs 01111E5, or 17B879DD, or something like that. Can someone please tell me why. I am aware that I set the limit of P instead of 10,001. My code is like that because I start with 3, skipping the prime number 2. #include <iostream> bool prime (int i) { bool result = true; int isitprime = i;…

  Read the article

• Write a program that computes and prints the 1000th prime number?

  - by Giribabu

  hai, plz answer this question.

  Read the article

• What is the smallest amount of bits you can write twin-prime calculation?

  - by HH

  A succinct example in Python, its source. Explanation about the syntactic sugar here. s=p=1;exec"if s%p*s%~-~p:print`p`+','+`p+2`\ns*=p*p;p+=2\n"*999 The smallest amount of bits is defined by the smallest amount of 4pcs of things you can see with hexdump, it is not that precise measure but well-enough until an ambiguity. $ echo…

  Read the article

• Threading across multiple files

  - by Zach M.

  My program is reading in files and using thread to compute the highest prime number, when I put a print statement into the getNum() function my numbers are printing out. However, it seems to just lag no matter how many threads I input. Each file has 1 million integers in it. Does anyone see something apparently wrong with my code?…

  Read the article

• Write a prime number generator to calculate/print all primes up to 1 billion (1x10^9). [closed]

  - by bachchan

  a) It must be able to calculate up to 1 billion on a computer with 1GB memory b) It should be fastest generator that you can create.

  Read the article

• Are there any working implementations of the rolling hash function used in the Rabin-Karp string sea

  - by c14ppy

  I'm looking to use a rolling hash function so I can take hashes of n-grams of a very large string. For example: "stackoverflow", broken up into 5 grams would be: "stack", "tacko", "ackov", "ckove", "kover", "overf", "verfl", "erflo", "rflow" This is ideal for a rolling hash function because after I calculate the first…

  Read the article

• Excel: Conditional Formatting (Highlighting) Values Based on Another Worksheet

  - by ScottSEA

  I have a workbook that has two worksheets. The first worksheet is simply a list of the first 78,498 prime numbers in a single column, A1-A78498. The second worksheet has a grid of numbers from 1 to n. The goal is to highlight the cells with prime numbers in the grid by referencing the prime number values in the other…

  Read the article

• Hash Functions. Commonly used method h(k) = k mod M,, Why we choose value of M to be prime no.

  - by RBA

  Hi, Please share the reason why in Hash Functions, the common method i.e. h(k) = k mod M... Why we choose the value of M to be always prime no. Thanks..

  Read the article

• Improving python code

  - by cobie

  I just answered the question on project euler about finding circular primes below 1 million using python. My solution is below. I was able to reduce the running time of the solution from 9 seconds to about 3 seconds. I would like to see what else can be done to the code to reduce its running time further. This is…

  Read the article

• Failed to get i915 symbols, graphics turbo disabled

  - by Optimus Prime

  I'm getting "Failed to get i915 symbols, graphics turbo disabled" error message after installing following softwares and few updates from Ubuntu. Django, Mysql server 5.5 Mysql benchmark And i have installed few updates for ubuntu. It was showing as Security Updates for Ubuntu. After installing Updates the…

  Read the article

• Decorate Your Desktop with the Rock Stars of Science [Wallpaper]

  - by Jason Fitzpatrick

  This understated desktop wallpaper showcases notable names in science with accompanying icons to represent their contribution to the field. The icons are the work of Megan Lee of Megan Lee Studios–you order prints, t-shirts, and other items with her designs on them here–and the wallpaper arrangement comes to…

  Read the article

• @CodeStock 2012 Review: Jay Harris ( @jayharris ) - XCopy is Dead: .Net Deployment Strategies that Work

  XCopy is Dead: .Net Deployment Strategies that WorkSpeaker: Jay HarrisTwitter: @jayharrisBlog: www.cptloadtest.com This talk focused on new technologies built in to deployment packaging through Visual Studios 2010.  Jay showed various methodologies in deploying web sites, and focused on features…

  Read the article

• @CodeStock 2012 Review: Jay Harris ( @jayharris ) - XCopy is Dead: .Net Deployment Strategies that Work

  XCopy is Dead: .Net Deployment Strategies that WorkSpeaker: Jay HarrisTwitter: @jayharrisBlog: www.cptloadtest.com This talk focused on new technologies built in to deployment packaging through Visual Studios 2010.  Jay showed various methodologies in deploying web sites, and focused on features…

  Read the article

• Automated testing tool development challenges (for embedded software)

  - by Karthi prime

  My boss want to come up with the proposal for the following tool: An IDE: Able to build, compile, debug, via JTAG programming for the micro-controller. A Test Suite, reads the code in the IDE, auto generates the test cases, and it gives the in-target unit testing results(which is done by controlling…

  Read the article

• Python - Check if numbers in list are factors of a number

  - by Zach

  Hey, I have a list of numbers (integers) (say, from 1 to 10). They're not necessarily consecutive, but they are in ascending order. I've prompted the user multiple times to enter a choice of the available numbers. When that number is entered, it is removed from the list along with any of its…

  Read the article

• Speed up bitstring/bit operations in Python?

  - by Xavier Ho

  I wrote a prime number generator using Sieve of Eratosthenes and Python 3.1. The code runs correctly and gracefully at 0.32 seconds on ideone.com to generate prime numbers up to 1,000,000. # from bitstring import BitString def prime_numbers(limit=1000000): '''Prime number generator. Yields…

  Read the article

• Error: "an object reference is required for the non-static field, method or property..."

  - by user300484

  Hi! Im creating an application on C#. Its function is to evualuate if a given is prime and if the same swapped number is prime as well. When I build my solution on Visual Studio, it says that "an object reference is required for the non-static field, method or property...". Im having this…

  Read the article

• Have I checked every consecutive subset of this list?

  - by Nathan

  I'm trying to solve problem 50 on Project Euler. Don't give me the answer or solve it for me, just try to answer this specific question. The goal is to find the longest sum of consecutive primes that adds to a prime below one million. I use wrote a sieve to find all the primes below n,…

  Read the article

• numerical computation locks up ruby

  - by kolosy

  i'm trying to implement an id obfuscation scheme, with a simple hash borrowed elsewhere. i've added a method on the application helper: @@M_ID = 2**31-1 @@PRIME = 1580030173 @@PRIME_INVERSE = 59260789 # (calculated from MAXID and PRIME offline) def obfuscate_id(x) if x …

  Read the article

• Sorting in Lua, counting number of items

  - by Josh

  Two quick questions (I hope...) with the following code. The script below checks if a number is prime, and if not, returns all the factors for that number, otherwise it just returns that the number prime. Pay no attention to the zs. stuff in the script, for that is client specific and…

  Read the article

• Where is the error in my code?

  - by Lulu Larson

  /** Yields: a String that contains each capital Letter (in 'A'..'Z') whose representation is prime */ public static String primeChars() { String s = ""; // inv: s contains each capital in "A'..c-1 whose representation is prime for (char c = 'A'; c <= 'Z';…

  Read the article

• dividing two array elements

  - by pradeep

  main() { int prime_array[2339],prime1_count=0,mul1_count=0; int i, prime, lim_up, lim_low, n,j=0; int mul,count=0; int mul_count[65026]={0},number[7096]; printf("\n ENTER THE LOWER LIMIT…: "); scanf("%d", &lim_low); printf("\n ENTER THE…

  Read the article

• Else without if

  - by user2808951

  I'm trying to write a code for my computer programming class for a project due Monday, and I'm pretty new to Java, but I'm trying to write a program that will first determine if a number the user inputs is even or odd and then determine if the number is prime or not.…

  Read the article

< Previous Page | 2 3 4 5 6 7 8 9 10 11 12 13  | Next Page >